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

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

We consider the problem of dividing some amount of an infinitely divisible and homogeneous resource among agents having claims on this resource that cannot be jointly honored. A "rule" associates with each such problem a feasible division. Our goal is to uncover the structure of the space of...

We consider the problem of dividing a non-homogeneous one- dimensional continuum whose endpoints are topologically identi¯ed. Examples are the division of a birthday cake, the partition of a circular market, the assignment of sentry duty or medical call. We study the existence of rules...