Stromquist, Walter

Envy-free cake divisions cannot be found by finite protocols

Electron. J. Comb. 15(1), Research Paper R11, 10 p. (2008)


Summary: 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.

Mathematics Subject Classification

91B32, 68Q17, 05D05