DagSemProc.07261.8.pdf
- Filesize: 108 kB
- 9 pages
Document
Envy-free cake divisions cannot be found by finite protocols
Author
-
Part of:
Volume:
Dagstuhl Seminar Proceedings, Volume 7261
Series: Dagstuhl Seminar Proceedings (DagSemProc) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2007-11-26
Cite AsGet BibTex
Walter Stromquist. Envy-free cake divisions cannot be found by finite protocols. In Fair Division. Dagstuhl Seminar Proceedings, Volume 7261, pp. 1-9, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)
https://doi.org/10.4230/DagSemProc.07261.8
https://doi.org/10.4230/DagSemProc.07261.8
Abstract
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.
Keywords
- Cake cutting
- envy free
- finite protocol
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads