For the problem of adjudicating conflicting claims, we consider the requirement that each agent should receive at least 1/n his claim truncated at the amount to divide, where n is the number of claimants (Moreno-Ternero and Villar, 2004a). We identify two families of rules satisfying this bound....

A group of agents have claims on a resource, but there is not enough of it to honor all of the claims. How should it be divided? A group of agents decide to undertake a public project that they can jointly afford. How much should each of them contribute? This essay is an update of Thomson...

For the problem of adjudicating conflicting claims, a rule is consistent if the choice it makes for each problem is always in agreement with the choice it makes for each "reduced problem" obtained by imagining that some claimants leave with their awards and reassessing the situation from the...

We define two families of rules to adjudicate conflicting claims. The first family contains the constrained equal awards, constrained equal losses, Talmud, and minimal overlap rules. The second family, which also contains the constrained equal awards and constrained equal losses rules, is...

In this work we deal with rationing problems. In particular with claims problems with indivisible goods, that is, problems in which a certain amount of indivisible units (of an homogeneous good), has to be distributed among a group of agents, when this amount is not enough to satisfy agents'...