A new solution to the problem of adjudicating conflicting claims
In this paper for the problem of adjudicating conflicting claims, the authors 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, 2004). They identify two families of rules satisfying this bound. And then they formulate the requirement that for each problem, the awards vector should be obtainable in two equivalent ways, (i) directly or (ii) in two steps, first assigning to each claimant his lower bound and then applying the rule to the appropriately revised problem. It is shown that there is only one rule satisfying this requirement. This is the ``recursive rule, as it is obtained be a recursion. Finally they undertake a systematic investigation of the properties of the rule.
- A unifying framework for the problem of adjudicating conflicting claims
- A characterization of a family of rules for the adjudication of conflicting claims
- On the adjudication of conflicting claims: an experimental study
- On the adjudication of conflicting claims: An experimental study
- A compromise solution for claims problems
- An alternative solution to bargaining problems with claims
- Two families of rules for the adjudication of conflicting claims
- Additive adjudication of conflicting claims
- Lower bounds and recursive methods for the problem of adjudicating conflicting claims
- On the existence of consistent rules to adjudicate conflicting claims: a constructive geometric approach
- Two families of rules for the adjudication of conflicting claims
- An algorithm for the min-max loss rule for claims problems
- Manipulation via merging and splitting in claims problems
- The two-agent claims-truncated proportional rule has no consistent extension: a constructive proof
- Families of sequential priority rules and random arrival rules with withdrawal limits
- A proportional approach to claims problems with a guaranteed minimum
- Constrained stochastic cost allocation
- Axiomatic and game-theoretic analysis of bankruptcy and taxation problems: an update
- Taxation and poverty
- A characterization of a family of rules for the adjudication of conflicting claims
- Lower bounds and recursive methods for the problem of adjudicating conflicting claims
- On the existence of consistent rules to adjudicate conflicting claims: a constructive geometric approach
- Additive adjudication of conflicting claims
- ERRATUM: "BANKRUPTCY RULES AND COALITIONAL MANIPULATION"
- On recursive solutions to simple allocation problems
- A new approach for bounding awards in bankruptcy problems
- A unifying framework for the problem of adjudicating conflicting claims
- Lorenz rankings of rules for the adjudication of conflicting claims
- Equal area rule to adjudicate conflicting claims
- Strategic justifications of the TAL family of rules for bankruptcy problems
- Resource allocations with guaranteed awards in claims problems
- Random conjugates of bankruptcy rules
- Reflecting inequality of claims in gains and losses
- Lorenz comparisons of nine rules for the adjudication of conflicting claims
- The average-of-awards rule for claims problems
- On the adjudication of conflicting claims: An experimental study
- The TAL-family of rules for bankruptcy problems
- New characterizations of a classical bankruptcy rule
- A characterization of optimistic weighted Shapley rules in minimum cost spanning tree problems
- Secured lower bound, composition up, and minimal rights first for bankruptcy problems
- Operators for the adjudication of conflicting claims
This page was built for publication: A new solution to the problem of adjudicating conflicting claims
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2494027)
