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}.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.GT 2years
2026 2representative citing papers
Balanced partitions exist that are O(max{√Δ, k²} ln n)-approximately envy-free and (k + o(k))-approximately core, with efficient computation under relaxed balance and stronger (1.618 + o(1))-core for k=2.
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}.
-
Some Improved Results on Fair and Balanced Graph Partitions
Balanced partitions exist that are O(max{√Δ, k²} ln n)-approximately envy-free and (k + o(k))-approximately core, with efficient computation under relaxed balance and stronger (1.618 + o(1))-core for k=2.