Multiple Birds with One Stone: Beating 1/2 for EFX and GMMS via Envy Cycle Elimination

by   Georgios Amanatidis, et al.

Several relaxations of envy-freeness, tailored to fair division in settings with indivisible goods, have been introduced within the last decade. Due to the lack of general existence results for most of these concepts, great attention has been paid to establishing approximation guarantees. In this work, we propose a simple algorithm that is universally fair in the sense that it returns allocations that have good approximation guarantees with respect to four such fairness notions at once. In particular, this is the first algorithm achieving a (ϕ -1)-approximation of envy-freeness up to any good (EFX) and a 2/ϕ +2-approximation of groupwise maximin share fairness (GMMS), where ϕ is the golden ratio (ϕ≈ 1.618). The best known approximation factor for either one of these fairness notions prior to this work was 1/2. Moreover, the returned allocation achieves envy-freeness up to one good (EF1) and a 2/3-approximation of pairwise maximin share fairness (PMMS). While EFX is our primary focus, we also exhibit how to fine-tune our algorithm and improve the guarantees for GMMS or PMMS. Finally, we show that GMMS -and thus PMMS and EFX- allocations always exist when the number of goods does not exceed the number of agents by more than two.


page 1

page 2

page 3

page 4


Comparing Approximate Relaxations of Envy-Freeness

In fair division problems with indivisible goods it is well known that o...

Connected Fair Allocation of Indivisible Goods

We study the fair allocation of indivisible goods under the assumption t...

Existence and Computation of Epistemic EFX

We consider the problem of allocating indivisible goods among n agents i...

Unified Fair Allocation of Goods and Chores via Copies

We consider fair allocation of indivisible items in a model with goods, ...

Keep Your Distance: Land Division With Separation

This paper is part of an ongoing endeavor to bring the theory of fair di...

REFORM: Reputation Based Fair and Temporal Reward Framework for Crowdsourcing

Crowdsourcing is an effective method to collect data by employing distri...

Weighted Fairness Notions for Indivisible Items Revisited

We revisit the setting of fairly allocating indivisible items when agent...