We propose two axioms that introduce lower bounds into resource monotonicity requirements for rules for the problem of adjudicating conflicting claims. Suppose the amount to divide increases. The first axiom requires that two claimants whose lower bound changes equally experience an equal change...

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

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 study lower bounds on the awards of each agent. We propose extending a lower bound by performing the following operation: (i) for each problem, assign the lower bound and revise the problem accordingly; (ii) assign the bound of the revised...

In a recent article, Fragnelli and Gagliardo [Cooperative models for allocating an object, Economics Letters 117 (2012) 227-229] propose several procedures to solve a basic problem of fair allocation. We scrutinize their proposal and contextualize it into recent developments of the literature on...

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

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

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

This paper reports an experimental study on three well-known solutions for problems of adjudicating conflicting claims: the constrained equal awards, the proportional, and the constrained equal losses rules. We first let subjects play three games designed such that the unique equilibrium...