How to divide things fairly

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

MPRA Paper from University Library of Munich, Germany

Abstract: We analyze a simple sequential algorithm (SA) for allocating indivisible items that are strictly ranked by n ≥ 2 players. It yields at least one Pareto-optimal allocation which, when n = 2, is envy-free unless no envy-free allocation exists. However, an SA allocation may not be maximin or Borda maximin—maximize the minimum rank, or the Borda score—of the items received by a player. Although SA is potentially vulnerable to manipulation, it would be difficult to manipulate in the absence of one player’s having complete information about the other players’ preferences. We discuss the applicability of SA, such as in assigning people to committees or allocating marital property in a divorce.

Keywords: Fair division; indivisible items; envy-freeness (search for similar items in EconPapers)
JEL-codes: C72 C78 D6 D61 D63 D7 D74 (search for similar items in EconPapers)
Date: 2014-09-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 (3)

Downloads: (external link)
https://mpra.ub.uni-muenchen.de/58370/1/MPRA_paper_58370.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:58370

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