Improved Approximate EFX Guarantees for Multigraphs
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 = ∞\), 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 amanatidis2024pushing shows that for additive (2,∞) bounded valuations, a \((23)\)-EFX allocation always exists. In this paper, we improve this bound by proving the existence of a \((12)\)-\(\) allocation for additive \((2,∞)\)-bounded valuations.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.