English

EFX Exists for Three Agents

Computer Science and Game Theory 2020-06-02 v3

Abstract

We study the problem of distributing a set of indivisible items among agents with additive valuations in a fair\mathit{fair} manner. The fairness notion under consideration is Envy-freeness up to any item (EFX). Despite significant efforts by many researchers for several years, the existence of EFX allocations has not been settled beyond the simple case of two agents. In this paper, we show constructively that an EFX allocation always exists for three agents. Furthermore, we falsify the conjecture by Caragiannis et al. by showing an instance with three agents for which there is a partial EFX allocation (some items are not allocated) with higher Nash welfare than that of any complete EFX allocation.

Keywords

Cite

@article{arxiv.2002.05119,
  title  = {EFX Exists for Three Agents},
  author = {Bhaskar Ray Chaudhury and Jugal Garg and Kurt Mehlhorn},
  journal= {arXiv preprint arXiv:2002.05119},
  year   = {2020}
}

Comments

Full version of a paper published at Economics and Computation (EC) 2020

R2 v1 2026-06-23T13:39:53.051Z