2 search results - page 1 / 1 » Meta-Envy-Free Cake-Cutting Protocols |
MFCS
2010
Springer
13 years 5 months ago
2010
Springer
This paper discusses cake-cutting protocols when the cake is a heterogeneous good that is represented by an interval in the real line. We propose a new desirable property, the meta...
AAIM
2008
Springer
13 years 9 months ago
2008
Springer
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.