Munich Personal RePEc Archive

Cutting a pie is not a piece of cake

Barbanel, Julius B. and Brams, Steven J. and Stromquist, Walter (2008): Cutting a pie is not a piece of cake. Forthcoming in: American Mathematical Monthly , Vol. 116, No. June/July 2009

[img]
Preview
PDF
MPRA_paper_12772.pdf

Download (1481Kb) | Preview

Abstract

Is there a division among n players of a cake using n-1 parallel vertical cuts, or of a pie using n radial cuts, that is envy-free (each player thinks he or she receives a largest piece and so does not envy another player) and undominated (there is no other allocation as good for all players and better for at least one)? David Gale first asked this question for pies. We provide complete answers for both cakes and pies. The answers depend on the number of players (two versus three or more players) and whether the players' preferences satisfy certain continuity assumptions. We also give some simple algorithms for cutting a pie when there are two or more players, but these algorithms do not guarantee all the properties one might desire in a division, which makes pie-cutting harder than cake-cutting. We suggest possible applications and conclude with two open questions.

UB_LMU-Logo
MPRA is a RePEc service hosted by
the Munich University Library in Germany.