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

We consider the problem of adjudicating conflicting claims in the context of a variable population. A property of rules is "lifted" if whenever a rule satisfies it in the two-claimant case, and the rule is bilaterally consistent, it satisfies it for any number of claimants. We identify a number...

We investigate the existence of consistent rules for the resolution of conflicting claims that generalize the Talmud rule but do not necessarily satisfy equal treatment of equal. The first approach we follow starts from the description of the Talmud rule in the two-claimant case as...

We consider the problem of adjudicating conflicting claims. A rule to solve such problems 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...

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