Contiguous cake cutting: Hardness results and approximation algorithms
We study the fair allocation of a cake, which serves as a metaphor for a divisible resource, under the requirement that each agent should receive a contiguous piece of the cake. While it is known that no finite envy-free algorithm exists in this setting, we exhibit efficient algorithms that produce...
| Hlavní autoři: | , , |
|---|---|
| Médium: | Conference item |
| Jazyk: | English |
| Vydáno: |
Association for the Advancement of Artificial Intelligence
2020
|