Researchers have advanced the study of approximate envy-freeness in the allocation of indivisible goods. The paper introduces new results for $2/3$-EFX allocations, which are a relaxation of exact EFX. These findings extend to scenarios with up to seven agents, or when agents' valuation functions have at most three values, or can be represented by a multigraph. The work pushes the boundaries of existence and computation for approximate EFX allocations. AI
RANK_REASON Academic paper on algorithmic game theory. [lever_c_demoted from research: ic=1 ai=0.1]
AI-generated summary · Google Gemini · from 1 sources. How we write summaries →