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...
| المؤلفون الرئيسيون: | , , |
|---|---|
| التنسيق: | Journal article |
| اللغة: | English |
| منشور في: |
AI Access Foundation
2020
|