Introduces CHB-k and CLB-k cake-cutting fairness hierarchies, with an O(n^4)-query protocol for CHB-n, an Ω(n^2) lower bound for CHB-2, and proof that CLB-2 and super envy-freeness require unbounded queries.
A dictatorship theorem for cake cutting
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.GT 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
On Hierarchies of Fairness Notions in Cake Cutting: From Proportionality to Super Envy-Freeness
Introduces CHB-k and CLB-k cake-cutting fairness hierarchies, with an O(n^4)-query protocol for CHB-n, an Ω(n^2) lower bound for CHB-2, and proof that CLB-2 and super envy-freeness require unbounded queries.