Envy-free cake divisions cannot be found by finite protocols (Q1010716)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Envy-free cake divisions cannot be found by finite protocols |
scientific article; zbMATH DE number 5540916
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Envy-free cake divisions cannot be found by finite protocols |
scientific article; zbMATH DE number 5540916 |
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
0.9014140963554382
0 references
0.9003914594650269
0 references
0.8706480860710144
0 references
