Sciweavers

Share
AAIM
2008
Springer

Confidently Cutting a Cake into Approximately Fair Pieces

8 years 5 months ago
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.
Jeff Edmonds, Kirk Pruhs, Jaisingh Solanki
Added 12 Oct 2010
Updated 12 Oct 2010
Type Conference
Year 2008
Where AAIM
Authors Jeff Edmonds, Kirk Pruhs, Jaisingh Solanki
Comments (0)
books