Allocating Indivisible Goods to Strategic Agents: Pure Nash Equilibria and Fairness
The work investigates mechanisms for fairly allocating indivisible goods to strategic agents, focusing on pure Nash equilibria and fairness guarantees. It shows that the Round-Robin mechanism guarantees envy-freeness up to one good (EF1) in its pure Nash equilibria. Furthermore, it explores how mechanisms leading to envy-free up to any good (EFX) allocations can also guarantee maximin share fairness (MMS).