Table of Contents
Fetching ...

EFX Exists for Three Types of Agents

Vishwa Prakash HV, Pratik Ghosal, Prajakta Nimbhorkar, Nithin Varma

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]).

EFX Exists for Three Types of Agents

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]).

Paper Structure

This paper contains 22 sections, 27 theorems, 11 equations, 1 figure, 1 algorithm.

Key Result

Theorem 1

An EFX allocation always exists for $n$ agents when there are at most three types of agents, where agents of the same type have identical additive valuations.

Figures (1)

  • Figure 1: Some examples of pseudo-cycles

Theorems & Definitions (58)

  • Theorem 1
  • Definition 1: Bundle, Allocation, and Sub-allocation
  • Definition 2: Pareto domination
  • Definition 3: Envy Graph
  • Definition 4: Strong envy
  • Definition 5: EFX
  • Proposition 1
  • Definition 6: Minimally envied subset efx_3
  • Definition 7: Champion efx_3
  • Definition 8: $g$-champion efx_3
  • ...and 48 more