R(d)<e d, so every additive fair-division instance has a partial (1−ε)-EFX allocation with O(√(n/ε)) unallocated goods, found by a randomized poly-time algorithm.
Title resolution pending
1 Pith paper cite this work, alongside 3 external citations. Polarity classification is still indexing.
1
Pith paper citing it
3
external citations · OpenAlex
fields
cs.GT 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
A Linear Bound on the Rainbow Cycle Number and Approximate EFX
R(d)<e d, so every additive fair-division instance has a partial (1−ε)-EFX allocation with O(√(n/ε)) unallocated goods, found by a randomized poly-time algorithm.