Year: 2008
Type: article
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.
DOI: 10.37236/735
Author: Walter Stromquist
Institution: Swarthmore College
Language: English
Subfield: Economics and Econometrics
Domain: Social Sciences
Open Access status: diamond
OpenAlex ID: W54061463