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.
Cite
CITATION STYLE
APA
Stromquist, W. (2008). Envy-free cake divisions cannot be found by finite protocols. In Electronic Journal of Combinatorics (Vol. 15, pp. 1–10). Australian National University. https://doi.org/10.37236/735
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free