| Autor: |
Brams, Steven J., Landweber, Peter S. |
| Předmět: |
|
| Zdroj: |
Mathematics Magazine; Apr2022, Vol. 95 Issue 2, p110-122, 13p |
| Abstrakt: |
We describe a 3-person, 2-cut envy-free cake-cutting algorithm, inspired by a continuous moving-knife procedure, that does not require that the players continuously move knifes across the cake. By having the players submit their value functions over the cake to a referee—rather than move knives according to these functions—the referee can ensure that the division is not only envy-free but also maximin. In addition, the referee can use the value functions to find a maximally equitable division, whereby the players receive equally valued shares that are maximal, but this allocation may not be envy-free. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Complementary Index |
| Externí odkaz: |
|
