No EFX allocation exists for tri-valued additive chore instances with n≥4 agents; EFX is incompatible with Pareto optimality for bi-valued positive-cost instances with n≥4; EFX exists for n=4.
A Proof of Theorem 1 for Generaln In this section, we prove Theorem 1 for an arbitrary fixedn≥4
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.GT 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
Simpler poly-time constructions for EF2X/EF3X and improved √2/2-EFX and 2/3-EFX approximations for monotone and additive valuations in restricted hypergraphs.
citing papers explorer
-
EFX for Additive Chores: Nonexistence, Pareto Incompatibility, and Bi-Valued Existence
No EFX allocation exists for tri-valued additive chore instances with n≥4 agents; EFX is incompatible with Pareto optimality for bi-valued positive-cost instances with n≥4; EFX exists for n=4.
-
Almost EFX in Hypergraphs
Simpler poly-time constructions for EF2X/EF3X and improved √2/2-EFX and 2/3-EFX approximations for monotone and additive valuations in restricted hypergraphs.