Two-person cake-cutting: the optimal number of cuts

Julius B. Barbanel and Steven Brams ()

MPRA Paper from University Library of Munich, Germany

Abstract: A cake is a metaphor for a heterogeneous, divisible good. When two players divide such a good, there is always a perfect division—one that is efficient (Pareto-optimal), envy-free, and equitable—which can be effected with a finite number of cuts under certain mild conditions; this is not always the case when there are more than two players (Brams, Jones, and Klamler, 2011b). We not only establish the existence of such a division but also provide an algorithm for determining where and how many cuts must be made, relating it to an algorithm, “Adjusted Winner” (Brams and Taylor, 1996, 1999), that yields a perfect division of multiple homogenous goods.

Keywords: Cake-cutting; fair division; envy-freeness; adjusted winner; heterogeneous good (search for similar items in EconPapers)
JEL-codes: C61 C72 D30 D61 D63 D74 (search for similar items in EconPapers)
Date: 2011-10-22
New Economics Papers: this item is included in nep-cis, nep-gth and nep-mic
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

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

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