Document Type
Article
Publication Date
1-1-2008
Published In
Electronic Journal Of Combinatorics
Abstract
We show that no finite protocol (even if unbounded) can guarantee an envy-free division of a cake among three or more players, if each player is to receive a single connected piece.
Recommended Citation
Walter Stromquist.
(2008).
"Envy-Free Cake Divisions Cannot Be Found By Finite Protocols".
Electronic Journal Of Combinatorics.
Volume 15,
https://works.swarthmore.edu/fac-math-stat/32