Two-Person Fair Division of Indivisible Items: An Efficient, Envy-Free Algorithm

Steven Brams (), D. Marc Kilgour and Christian Klamler

MPRA Paper from University Library of Munich, Germany

Abstract: Many procedures have been suggested for the venerable problem of dividing a set of indivisible items between two players. We propose a new algorithm (AL), related to one proposed by Brams and Taylor (BT), which requires only that the players strictly rank items from best to worst. Unlike BT, in which any item named by both players in the same round goes into a “contested pile,” AL may reduce, or even eliminate, the contested pile, allocating additional or more preferred items to the players. The allocation(s) that AL yields are Pareto-optimal, envy-free, and maximal; as the number of items (assumed even) increases, the probability that AL allocates all the items appears to approach infinity if all possible rankings are equiprobable. Although AL is potentially manipulable, strategizing under it would be difficult in practice.

Keywords: Two-person fair division; indivisible items; envy-freeness; efficiency; algorithm (search for similar items in EconPapers)
JEL-codes: C7 C78 D6 D61 D63 D7 D74 (search for similar items in EconPapers)
Date: 2013-06
New Economics Papers: this item is included in nep-gth, nep-hpe and nep-mic
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (8)

Downloads: (external link)
https://mpra.ub.uni-muenchen.de/47400/1/MPRA_paper_47400.pdf original version (application/pdf)

Related works:
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:pra:mprapa:47400

Access Statistics for this paper

More papers in MPRA Paper from University Library of Munich, Germany Ludwigstraße 33, D-80539 Munich, Germany. Contact information at EDIRC.
Bibliographic data for series maintained by Joachim Winter ().