Abstract:With strong evidence in the literature showing that fairness and truthfulness are incompatible, there is a recent line of work focusing on the fairness properties of equilibria of simple fair division mechanisms, especially Round-Robin. We consider the Envy Cycle Elimination (E-C-E) procedure of Lipton et al. [23], one of the most versatile tools in fair division. While this simple and intuitive algorithm achieves allocations that are envy-free up to one item (EF1) for any number of agents and general monotone valuation functions, surprisingly little is known about its behavior when agents act strategically. We demonstrate how the presence of incentives, although highly natural and relevant for the majority of applications, completely removes the intuitive clarity in the algorithm's execution, even for a few agents and very simple valuation functions. Additionally, while in the standard algorithmic setting there is great flexibility in how the details of E-C-E are implemented, here additional specifications are needed before the procedure is clearly defined, the choice of which has a potentially huge impact on the agents' behavior. Despite these obstacles, for various natural versions of E-C-E, we give the first results on the existence of Pure Nash Equilibria of the resulting mechanisms, and show there exist versions where fairness guarantees are approximately preserved for agents who play best responses.
From: Georgios Birmpas [view email]
[v1]
Fri, 29 May 2026 12:50:25 UTC (33 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。