For any k>2, (k+1)/(k+2)-EFkX allocations exist for any number of agents and are polynomial-time computable; 3/4-EF2X holds for all agents and 2/3-EFX extends to 8 agents, while EFkX orientations are NP-complete to decide.
arXiv preprint arXiv:2508.15380 , year=
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
-
Approximate Envy-Free Allocations up to any $k$ Goods
For any k>2, (k+1)/(k+2)-EFkX allocations exist for any number of agents and are polynomial-time computable; 3/4-EF2X holds for all agents and 2/3-EFX extends to 8 agents, while EFkX orientations are NP-complete to decide.
-
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.