Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
158 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Improved Approximate EFX Guarantees for Multigraphs (2506.09288v1)

Published 10 Jun 2025 in cs.GT

Abstract: In recent years, a new line of work in fair allocation has focused on 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 \citet{amanatidis2024pushing} shows that for additive $(2,\infty)$ bounded valuations, a ((\nicefrac{2}{3}))-EFX allocation always exists. In this paper, we improve this bound by proving the existence of a ((\nicefrac{1}{\sqrt{2}}))-(\efx) allocation for additive ((2,\infty))-bounded valuations.

Summary

We haven't generated a summary for this paper yet.