Hannaneh Akrami
Kurt Mehlhorn
ABSTRACT
The existence of EFX allocations is a fundamental open problem in discrete fair division. Since the general problem has been elusive, progress is made on two fronts: (i) proving existence when the number of agents is small, and (ii) proving the existence of relaxations of EFX. In this paper, we improve and simplify the state-of-the-art results on both fronts with new techniques.
Index Terms
- EFX: A Simpler Approach and an (Almost) Optimal Guarantee via Rainbow Cycle Number
Recommendations
Improving EFX Guarantees through Rainbow Cycle Number
EC '21: Proceedings of the 22nd ACM Conference on Economics and ComputationWe study the problem of fairly allocating a set of indivisible goods among n agents with additive valuations. Envy-freeness up to any good (EFX) is arguably the most compelling fairness notion in this context. However, the existence of EFX allocations ...
EFX Exists for Three Agents
EC '20: Proceedings of the 21st ACM Conference on Economics and ComputationWe study the problem of distributing a set of indivisible items among agents with additive valuations in a fairmanner. The fairness notion under consideration is Envy-freeness up to anyitem (EFX). Despite significant efforts by many researchers for ...
EFX Allocations for Indivisible Chores: Matching-Based Approach
Algorithmic Game TheoryAbstractOne of the most important topics in discrete fair division is whether an EFX allocation exists for any instance. Although the existence of EFX allocations is a standing open problem for both goods and chores, the understanding of the existence of ...
Comments