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...
Main Authors: | Goldberg, PW, Hollender, A, Suksompong, W |
---|---|
Format: | Journal article |
Language: | English |
Published: |
AI Access Foundation
2020
|
Similar Items
-
Contiguous cake cutting: Hardness results and approximation algorithms
by: Goldberg, PW, et al.
Published: (2020) -
Mind the gap: cake cutting with separation
by: Elkind, E, et al.
Published: (2022) -
Fairly allocating contiguous blocks of indivisible items
by: Suksompong, W
Published: (2019) -
Fairly allocating contiguous blocks of indivisible items
by: Suksompong, W
Published: (2017) -
Consensus halving for sets of items
by: Goldberg, PW, et al.
Published: (2022)