How to cut a cake almost fairly

Authors:
Sven O. Krumke;Maarten Lipmann;Willem E. de Paepe;Diana Poensgen;Jörg Rambau;Leen Stougie;Gerhard J. Woeginger
Affiliations:
Konrad-Zuse-Zentrum für Informationstechnik Berlin (ZIB), Germany;Technical University of Eindhoven, The Netherlands;Technical University of Eindhoven, The Netherlands;ZIB, Germany;ZIB, Germany;Technical University of Eindhoven, The Netherlands;University of Twente, The Netherlands
Venue:
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Year:
2002

Citing 1
Cited 5

How to cut a cake fairly using a minimal number of cuts

Discrete Applied Mathematics

An Approximation Scheme for Cake Division with a Linear Number of Cuts

ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Cake cutting really is not a piece of cake

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Confidently Cutting a Cake into Approximately Fair Pieces

AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
Negotiation criteria for multiagent resource allocation

The Knowledge Engineering Review
Cake cutting really is not a piece of cake

ACM Transactions on Algorithms (TALG)

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.