English

Improved Approximate EFX Guarantees for Multigraphs

Computer Science and Game Theory 2025-07-21 v2

Abstract

In recent years, a new line of work in fair allocation has focused on EFX allocations for (p,q)(p, q)-bounded valuations, where each good is relevant to at most pp agents, and any pair of agents share at most qq relevant goods. For the case p=2p = 2 and q=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 \citet{amanatidis2024pushing} shows that for additive (2,)(2,\infty) bounded valuations, a (\nicefrac23)(\nicefrac{2}{3})-EFX allocation always exists. In this paper, we improve this bound by proving the existence of a (\nicefrac12)(\nicefrac{1}{\sqrt{2}})-\efx\efx allocation for additive (2,)(2,\infty)-bounded valuations.

Cite

@article{arxiv.2506.09288,
  title  = {Improved Approximate EFX Guarantees for Multigraphs},
  author = {Alireza Kaviani and Alireza Keshavarz and Masoud Seddighin and AmirMohammad Shahrezaei},
  journal= {arXiv preprint arXiv:2506.09288},
  year   = {2025}
}
R2 v1 2026-07-01T03:10:20.843Z