The paper proves explicit constant-factor inapproximability for EFX allocations of indivisible chores under monotone submodular and subadditive cost functions, with a 3-agent 6-chore instance ruling out factors below 2^{1/3}.
Narayan and Paritosh Verma , title =
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.GT 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
A Note on EFX Inapproximability for Chores
The paper proves explicit constant-factor inapproximability for EFX allocations of indivisible chores under monotone submodular and subadditive cost functions, with a 3-agent 6-chore instance ruling out factors below 2^{1/3}.