Year: 2026
Type: preprint
Abstract: The envy cycle elimination (ECE) algorithm is a fundamental algorithm for the fair allocation of indivisible goods, guaranteeing an allocation that is envy-free up to one good under arbitrary monotone utilities. We show that the ECE algorithm can be implemented in $O(nm)$ time for $n$ agents and $m$ goods, and establish the tightness of this bound.
Source: arXiv (Cornell University)
Author: Suksompong, Warut
Institution: National University of Singapore
Language: English
Subfield: Economics and Econometrics
Domain: Social Sciences
Open Access status: green
OpenAlex ID: W7236764476
