Confidently Cutting a Cake into Approximately Fair Pieces

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.

• Type: Conference
• Year: 2008
• Where: AAIM
• Authors: Jeff Edmonds, Kirk Pruhs, Jaisingh Solanki
• Keywords: AAIM 2008, Algorithms, Cake Cutting Problem, Proportional Fairness, Randomized Protocol