Pushing the Frontier on Approximate EFX Allocations
Georgios Amanatidis, Aris Filos-Ratsikas, Alkmini Sgouritsa

TL;DR
This paper advances the understanding of approximate envy-freeness in indivisible goods allocation by establishing new existence results for 2/3-approximate EFX allocations under specific conditions, surpassing previous bounds.
Contribution
It proves the existence of 2/3-EFX allocations in settings with up to seven agents, three valuation levels, or multigraph valuations, extending known results for approximate EFX.
Findings
2/3-EFX allocations exist for up to seven agents
Achieved better approximation than the previous 0.618 bound
Provides new insights into the existence of approximate EFX allocations
Abstract
We study the problem of allocating a set of indivisible goods to a set of agents with additive valuation functions, aiming to achieve approximate envy-freeness up to any good (-EFX). The state-of-the-art results on the problem include that (exact) EFX allocations exist when (a) there are at most three agents, or (b) the agents' valuation functions can take at most two values, or (c) the agents' valuation functions can be represented via a graph. For -EFX, it is known that a -EFX allocation exists for any number of agents with additive valuation functions. In this paper, we show that -EFX allocations exist when (a) there are at most \emph{seven agents}, (b) the agents' valuation functions can take at most \emph{three values}, or (c) the agents' valuation functions can be represented via a \emph{multigraph}. Our results can be interpreted in two ways. First, by…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsScheduling and Optimization Algorithms · Electric Power System Optimization
MethodsSparse Evolutionary Training
