Name
Abstract | ||
|---|---|---|
In the cake cutting problem, n ≥ 2 players want to cut a cake into n pieces so that every player gets a "fair" share of the cake by his own measure. We describe a protocol with n - 1 cuts in which each player can enforce to get a share of at least 1/(2n - 2) of the cake. Moreover we show that no protocol with n - 1 cuts can guarantee a better fraction. |
Year | DOI | Venue |
|---|---|---|
2002 | 10.5555/545381.545415 | SODA |
Keywords | Field | DocType |
n piece,own measure,better fraction | Discrete mathematics,Combinatorics,A share,Fair division,Mathematics | Conference |
ISBN | Citations | PageRank |
0-89871-513-X | 8 | 1.56 |
References | Authors | |
1 | 7 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sven O. Krumke | 1 | 308 | 36.62 |
| Maarten Lipmann | 2 | 34 | 4.65 |
| Willem E. de Paepe | 3 | 117 | 9.74 |
| Diana Poensgen | 4 | 31 | 4.48 |
| Jörg Rambau | 5 | 181 | 24.38 |
| Leen Stougie | 6 | 892 | 107.93 |
| Gerhard Woeginger | 7 | 4176 | 384.37 |