Two-player envy-free multi-cake division

John Cloutier, Kathryn L. Nyman and Francis Edward Su

Mathematical Social Sciences, 2010, vol. 59, issue 1, 26-37

Abstract: We introduce a generalized cake-cutting problem in which we seek to divide multiple cakes so that two players may get their most-preferred piece selections: a choice of one piece from each cake, allowing for the possibility of linked preferences over the cakes. For two players, we show that disjoint envy-free piece selections may not exist for two cakes cut into two pieces each, and they may not exist for three cakes cut into three pieces each. However, there do exist such divisions for two cakes cut into three pieces each, and for three cakes cut into four pieces each. The resulting allocations of pieces to players are Pareto-optimal with respect to the division. We use a generalization of Sperner's lemma on the polytope of divisions to locate solutions to our generalized cake-cutting problem.

Keywords: Fair; division; Envy-free; Sperner's; lemma; Polytope; Labelings (search for similar items in EconPapers)
Date: 2010
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0165-4896(09)00081-X
Full text for ScienceDirect subscribers only

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:eee:matsoc:v:59:y:2010:i:1:p:26-37

Access Statistics for this article

Mathematical Social Sciences is currently edited by J.-F. Laslier

More articles in Mathematical Social Sciences from Elsevier
Bibliographic data for series maintained by Catherine Liu ().