License
When quoting this document, please refer to the following
DOI: 10.4230/DagSemProc.07261.8
URN: urn:nbn:de:0030-drops-12208
URL: https://drops.dagstuhl.de/opus/volltexte/2007/1220/
Go to the corresponding Portal


Stromquist, Walter

Envy-free cake divisions cannot be found by finite protocols

pdf-format:
07261.StromquistWalter.Paper.1220.pdf (0.1 MB)


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.



BibTeX - Entry

@InProceedings{stromquist:DagSemProc.07261.8,
  author =	{Stromquist, Walter},
  title =	{{Envy-free cake divisions cannot be found by finite protocols}},
  booktitle =	{Fair Division},
  pages =	{1--9},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2007},
  volume =	{7261},
  editor =	{Steven Brams and Kirk Pruhs and Gerhard Woeginger},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2007/1220},
  URN =		{urn:nbn:de:0030-drops-12208},
  doi =		{10.4230/DagSemProc.07261.8},
  annote =	{Keywords: Cake cutting, envy free, finite protocol}
}

Keywords: Cake cutting, envy free, finite protocol
Collection: 07261 - Fair Division
Issue Date: 2007
Date of publication: 26.11.2007


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI