Envy-free cake divisions cannot be found by finite protocols (Q1010716): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 22:11, 30 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Envy-free cake divisions cannot be found by finite protocols |
scientific article |
Statements
Envy-free cake divisions cannot be found by finite protocols (English)
0 references
7 April 2009
0 references
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.
0 references