3 search results - page 1 / 1 » Confidently Cutting a Cake into Approximately Fair Pieces |
AAIM
2008
Springer
13 years 6 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.
AAAI
2012
11 years 7 months ago
2012
We consider the classic cake cutting problem where one allocates a divisible cake to n participating agents. Among all valid divisions, fairness and efficiency (a.k.a. social wel...
WINE
2010
Springer
13 years 2 months ago
2010
Springer
der the issue of fair division of goods, using the cake cutting abstraction, and aim to bound the possible degradation in social welfare due to the fairness requirements. Previous...