Novel cake-cutting and envy-free share notions for divisible goods are simultaneously achievable only up to a tight Θ(√n) approximation in the worst case.
A polynomial-time algorithm for computing a pareto optimal and almost proportional allocation
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.GT 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Fair Division via the Cake-Cutting Share
Novel cake-cutting and envy-free share notions for divisible goods are simultaneously achievable only up to a tight Θ(√n) approximation in the worst case.