How to cut a cake almost fairly

S.O. Krumke, M. Lipmann, W.E. Paepe, de, D. Poensgen, J. Rambau, L. Stougie, G.J. Woeginger

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

7 Citations (Scopus)
1 Downloads (Pure)


In the cake cutting problem, n = 2 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) of the cake. Moreover we show that no protocol with n - 1 cuts can guarantee a better fraction.
Original languageEnglish
Title of host publicationProceedings 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'02, San Francisco CA, USA, January 6-8, 2002)
Place of PublicationPhiladelphia
PublisherSociety for Industrial and Applied Mathematics (SIAM)
ISBN (Print)0-89871-513-X
Publication statusPublished - 2002
Eventconference; San Francisco, CA, USA; 2002-01-06; 2002-01-08 -
Duration: 6 Jan 20028 Jan 2002


Conferenceconference; San Francisco, CA, USA; 2002-01-06; 2002-01-08
OtherSan Francisco, CA, USA

Cite this