@misc{KrumkeLipmannPaepeetal.2002, author = {Krumke, Sven and Lipmann, Maarten and Paepe, Willem de and Poensgen, Diana and Rambau, J{\"o}rg and Stougie, Leen and Woeginger, Gerhard}, title = {How to Cut a Cake Almost Fairly}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-6905}, number = {02-23}, year = {2002}, abstract = {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.}, language = {en} }