Filtern
Erscheinungsjahr
- 2002 (1) (entfernen)
Dokumenttyp
- ZIB-Report (1) (entfernen)
Sprache
- Englisch (1)
Volltext vorhanden
- ja (1) (entfernen)
Gehört zur Bibliographie
- nein (1)
Schlagworte
- Fair division (1)
- cake cutting (1)
Institut
- ZIB Allgemein (1)
In the cake cutting problem, $n\ge2$ players want to cut a cake into $n$ pieces so that every player gets a ``fair'' share of the cake by his own measure. We describe a protocol with $n-1$~cuts in which each player can enforce to get a share of at least~$1/(2n-2)$. Moreover we show that no protocol with $n-1$~cuts can guarantee a better fraction.