Envy-Free Cake Divisions Cannot be Found by Finite Protocols

  • Walter Stromquist
DOI: https://doi.org/10.37236/735

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.

Published
2008-01-07
Issue
Volume 15 (2008)
Article Number
R11