In recent years, a new line of work in fair allocation has focused on \(\textsf{EFX}\) allocations for (p, q)-bounded valuations, where each good is relevant to at most p agents, and any pair of agents share at most q relevant goods. For the case \(p = 2\) and \(q = \infty \) , such instances can be equivalently represented as multigraphs whose vertices are the agents and whose edges represent goods, each edge incident to exactly the one or two agents for whom the good is relevant. A recent result of Amanatidis et al. [7] shows that for additive \((2,\infty )\) bounded valuations, a \((\nicefrac {2}{3})\) - \(\textsf{EFX}\) allocation always exists. In this paper, we improve this bound by proving the existence of a \((\nicefrac {1}{\sqrt{2}})\) - \(\textsf{EFX}\) allocation for additive \((2,\infty )\) -bounded valuations.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Improved Approximate EFX Guarantees for Multigraphs

  • Alireza Kaviani,
  • Alireza Keshavarz,
  • Masoud Seddighin,
  • AmirMohammad Shahrezaei

摘要

In recent years, a new line of work in fair allocation has focused on \(\textsf{EFX}\) allocations for (p, q)-bounded valuations, where each good is relevant to at most p agents, and any pair of agents share at most q relevant goods. For the case \(p = 2\) and \(q = \infty \) , such instances can be equivalently represented as multigraphs whose vertices are the agents and whose edges represent goods, each edge incident to exactly the one or two agents for whom the good is relevant. A recent result of Amanatidis et al. [7] shows that for additive \((2,\infty )\) bounded valuations, a \((\nicefrac {2}{3})\) - \(\textsf{EFX}\) allocation always exists. In this paper, we improve this bound by proving the existence of a \((\nicefrac {1}{\sqrt{2}})\) - \(\textsf{EFX}\) allocation for additive \((2,\infty )\) -bounded valuations.