We study the behavior of rules for the adjudication of con°icting claims when there are a large number of claimants with small claims. We model such situations by replicating some basic problem. We show that under replication, the random arrival rule (O'Neill, 1982) behaves like the...

We consider the problem of dividing the cost of a facility when agents can be ordered in terms of the need they have for it, and accommodating an agent with a certain need allows accommodating all agents with lower needs at no extra cost. This problem is known as the “airport problem”, the...

For the problem of adjudicating conflicting claims, we offer simple criteria to compare rules on the basis of the Lorenz order. These criteria pertain to three families of rules. The first family contains the constrained equal awards, constrained equal losses, Talmud, and minimal overlap rules...

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....

We construct "simple" games implementing in Nash equilibria several solutions to the problem of fair division. These solutions are the no-envy solution, which selects the allocations such that no agent would prefer someone else's bundle to his own, and several variants of this solution....

An allocation rule is consistent if the recommendation it makes for each problem “agrees” with the recommendation it makes for each associated reduced problem, obtained by imagining some agents leaving with their assignments. Some authors have described the consistency principle as a...

We identify previously unnoticed ways in which agents can strategically distort allocation rules, by affecting the set of “active” agents. (i) An agent withdraws with his endowment. (ii) He gives control of his endowment to someone else and withdraws. (iii) He invites someone in and let him...