This paper explores mechanisms for fairly allocating indivisible goods to strategic agents with additive valuations. The research focuses on whether mechanisms can guarantee pure Nash equilibria while also ensuring fairness, specifically envy-freeness up to one good (EF1) and envy-freeness up to any good (EFX). The study finds that the Round-Robin algorithm's pure Nash equilibria result in EF1 allocations, and a cut-and-choose algorithm by Plaut and Roughgarden yields EFX allocations that also satisfy maximin share fairness for two agents. AI
RANK_REASON The cluster contains a single academic paper on a theoretical computer science topic. [lever_c_demoted from research: ic=1 ai=0.4]
- arXiv
- Georgios Amanatidis
- Plaut and Roughgarden
- round-robin tournament
- SIAM Journal of Discrete Mathematics
AI-generated summary · Google Gemini · from 1 sources. How we write summaries →