License
When quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-12208
URL: http://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:
Document 1.pdf (108 KB)


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:DSP:2007:1220,
  author =	{Walter Stromquist},
  title =	{Envy-free cake divisions cannot be found by finite protocols},
  booktitle =	{Fair Division},
  year =	{2007},
  editor =	{Steven Brams and Kirk Pruhs and Gerhard Woeginger},
  number =	{07261},
  series =	{Dagstuhl Seminar Proceedings},
  ISSN =	{1862-4405},
  publisher =	{Internationales Begegnungs- und Forschungszentrum f{\"u}r Informatik (IBFI), Schloss Dagstuhl, Germany},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2007/1220},
  annote =	{Keywords: Cake cutting, envy free, finite protocol}
}

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


DROPS-Home | Fulltext Search | Imprint Published by LZI