Confidently Cutting a Cake into Approximately Fair Pieces

Authors:
Jeff Edmonds;Kirk Pruhs;Jaisingh Solanki
Affiliations:
Department of Computer Science and Engineering, York University,;Computer Science Department, University of Pittsburgh,;Department of Computer Science and Engineering, York University,
Venue:
AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
Year:
2008

Citing 8
Cited 2

Approximating fair division with a limited number of cuts

Journal of Combinatorial Theory Series A
Balanced Allocations

SIAM Journal on Computing
How to cut a cake almost fairly

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Cake-Cutting Is Not a Piece of Cake

STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
On-line Load Balancing

Developments from a June 1996 seminar on Online algorithms: the state of the art
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
Balanced Allocations of Cake

FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science

Cutting a Cake for Five People

AAIM '09 Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management
Cake cutting really is not a piece of cake

ACM Transactions on Algorithms (TALG)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give a randomized protocol for the classic cake cutting problem that guarantees approximate proportional fairness, and with high probability uses a linear number of cuts.