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.
Theoretical Computer Science , volume =
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.GT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
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.