(Almost Full) EFX for Three (and More) Types of Agents

We study the problem of determining an envy-free allocation of indivisible goods among multiple agents with additive valuations. EFX, which stands for envy-freeness up to any good, is a well-studied relaxation of the envy-free allocation problem and has been shown to exist for specific scenarios. EFX is known to exist for three agents, and for any number of agents when there are only two types of valuations. EFX allocations are also known to exist for four agents with at most one good unallocated. In this paper, we show that EFX exists with at most k-2 goods unallocated for any number of agents having k distinct valuations. Additionally, we show that complete EFX allocations exist when all but two agents have identical valuations.

Authors

Institutions

Publication Details

Journal
Proceedings of the AAAI Conference on Artificial Intelligence
Published
2025-04-11
DOI
https://doi.org/10.1609/aaai.v39i13.33519
Citations
1
Primary Topic
Multi-Agent Systems and Negotiation
Type
article
Field-Weighted Citation Impact
0.89
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

(Almost Full) EFX for Three (and More) Types of Agents

Prajakta Nimbhorkar, Pratik Ghosal, Nithin Varma, Vishwa Prakash HV
1 citations
Proceedings of the AAAI Conference on Artificial Intelligence
Multi-Agent Systems and Negotiation
0.89
article

(Almost Full) EFX for Three (and More) Types of Agents

Prajakta Nimbhorkar, Pratik Ghosal, Nithin Varma, Vishwa Prakash HV
article en
1 citations

Abstract

We study the problem of determining an envy-free allocation of indivisible goods among multiple agents with additive valuations. EFX, which stands for envy-freeness up to any good, is a well-studied relaxation of the envy-free allocation problem and has been shown to exist for specific scenarios. EFX is known to exist for three agents, and for any number of agents when there are only two types of valuations. EFX allocations are also known to exist for four agents with at most one good unallocated. In this paper, we show that EFX exists with at most k-2 goods unallocated for any number of agents having k distinct valuations. Additionally, we show that complete EFX allocations exist when all but two agents have identical valuations.

Proceedings of the AAAI Conference on Artificial IntelligenceVol. 39(13)
University of Cologne (DE), Chennai Mathematical Institute (IN), Indian Institute of Technology Palakkad (IN)
Openalex Percentile: Top 28%
Multi-Agent Systems and Negotiation
0.89
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

(Almost Full) EFX for Three (and More) Types of Agents — Prajakta Nimbhorkar, Pratik Ghosal, et al. · Proceedings of the AAAI Conference on Artificial Intelligence (2025) | TGRS Research Map | TGRS