Envy-free cake divisions cannot be found by finite protocols (Q1010716): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: author (P16): Item:Q1294035 |
||
| Property / author | |||
| Property / author: Walter R. Stromquist / rank | |||
Revision as of 23:43, 22 February 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
