As Roemer (1986) points out, things become more interesting once we include information. In this paper, following the line started by Jiménez-Gómez and Marco-Gil (2008), we define both a lower and an upper bounds on awards in the framework of the Lorenz-Bifocal Bankruptcy Problem (Gadea et al....

In a distribution problem, and speci fically in bankruptcy issues, the Proportional (P) and the Egalitarian (EA) divisions are two of the most popular ways to resolve the conflict. The Constrained Equal Awards rule (CEA) is introduced in bankruptcy literature to ensure that no agent receives...

Mediation is a dispute resolution process where agents reach a mutually acceptable agreement among prominent proposals. This paper provides a natural way of coming to this agreement in bankruptcy problems. The central fact is that such problems can be faced from two different (focal) points of...

The idea of ensuring a guarantee (a minimum amount of the resources) to each agent has recently acquired great relevance, in both social and political terms. Furthermore, the notion of Solidarity has been treated frequently in redistribution problems to establish that any increment of the...

As it is known, there is no rule satisfying Additivity on the complete domain of bankruptcy problems. This paper proposes a notion of partial Additivity in this context, to be called µ-Additivity. We find that µ-Additivity, together with two quite compelling axioms, Anonymity and Continuity,...

In a distribution problem, and specifically in bankruptcy issues, the Proportional (P) and theEgalitarian (EA) divisions are two of the most popular ways to resolve the conflict. TheConstrained Equal Awards rule (CEA) is introduced in bankruptcy literature to ensure that noagent receives more...

As it is known, there is no rule satisfying Additivity in the complete domain of bankruptcy problems. This paper proposes a notion of partial Additivity in this context, to be called m-additivity. We find that m-additivity, together with two quite compelling axioms, anonymity and continuity,...

This paper starts from a classical fair division situation of allocating an object among a set of agents. The problem is studied from both a cooperative and a bankruptcy point of view, analyzing the fairness properties of the proposed solutions.

By generalizing the standard solution for 2-person games into n-person cases, this paper develops a new solution concept for cooperative games: the consensus value.We characterize the consensus value as the unique function that satisfies efficiency, symmetry, the quasi dummy property and...

We consider envy-free (and budget-balanced) rules that are least manipulable with respect to agents counting or with respect to utility gains. Recently it has been shown that for any profile of quasi-linear preferences, the outcome of any such least manipulable envy-free rule can be obtained via...