A New Solution to the Problem of Adjudicating Conflicting Claims

Diego Dominguez () and William Thomson

No 511, RCER Working Papers from University of Rochester - Center for Economic Research (RCER)

Abstract: 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 then 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. We show that there is only one rule satisfying this requirement. We name it the "recursive rule", as it is obtained by a recursion. We then undertake a systematic investigation of the properties of the rule.

Keywords: claims problems; recursive rule. (search for similar items in EconPapers)
JEL-codes: C79 D63 D74 (search for similar items in EconPapers)
Pages: 34 pages
Date: 2004-11
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://rcer.econ.rochester.edu/RCERPAPERS/rcer_511.pdf full text (application/pdf)
None

Related works:
Journal Article: A new solution to the problem of adjudicating conflicting claims (2006)
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:roc:rocher:511

Access Statistics for this paper

More papers in RCER Working Papers from University of Rochester - Center for Economic Research (RCER) University of Rochester, Center for Economic Research, Department of Economics, Harkness 231 Rochester, New York 14627 U.S.A.. Contact information at EDIRC.
Bibliographic data for series maintained by Richard DiSalvo ( this e-mail address is bad, please contact ).