Envy-free cake divisions cannot be found by finite protocols (Q1010716): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
| (3 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: Walter R. Stromquist / rank | |||
| Property / author | |||
| Property / author: Walter R. Stromquist / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 01:53, 5 March 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
