EFX Exists for Three Types of Agents

Vishwa Prakash HV, Pratik Ghosal, Prajakta Nimbhorkar, Nithin Varma
10/17/2024
cs.GTcs.DScs.MA

No confident code implementation found for this paper. 1 possible match can be shown below.

Abstract

We study the problem of finding an envy-free allocation of indivisible goods among agents with additive valuations. We focus on the fairness notion of envy-freeness up to any good (EFX). A central open question in fair division is whether EFX allocations always exist for any number of agents. While EFX has been established for three agents [CGM24] and for any number of agents with at most two distinct valuations [Mah23], its existence in more general settings remains open. In this paper, we make significant progress by proving that EFX allocations exist for any number of agents when there are at most three distinct additive valuations. This result simultaneously generalizes both the three-agent case and the two-type case, settling an open question in the field (see [Mah23]).

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 1 weaker match is hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{hv2024exists,
  title  = {EFX Exists for Three Types of Agents},
  author = {Vishwa Prakash HV and Pratik Ghosal and Prajakta Nimbhorkar and Nithin Varma},
  year   = {2024},
  eprint = {2410.13580},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2410.13580v3}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2410.13580.svg)](https://codeofpaper.com/paper/2410.13580)

Discussion