Sep 17, 2019 · In this work, we propose a simple algorithm that is universally fair in the sense that it returns allocations that have good approximation guarantees.

Nov 12, 2020 · In this work, we propose a simple algorithm that is universally fair in the sense that it returns allocations that have good approximation guarantees.

At a technical level, our results are making use of two algorithms that are known to produce only EF1 allocations. The first one is a simple draft algorithm and ...

Nov 12, 2020 · 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 ...

This work proposes a simple algorithm that is universally fair in the sense that it returns allocations that have good approximation guarantees with respect ...

Sep 4, 2023 · Bibliographic details on Multiple Birds with One Stone: Beating 1/2 for EFX and GMMS via Envy Cycle Elimination.

Cycling. Article. Multiple birds with one stone: Beating 1/2 for EFX and GMMS via envy cycle elimination. July 2020; Theoretical Computer Science 841(4). 841(4).

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

Mar 6, 2021 · Multiple Birds with One Stone: Beating 1/2 for. EFX and GMMS via Envy Cycle Elimination. Georgios Amanatidis1,2, Evangelos Markakis3, and ...

Multiple Birds with One Stone: Beating 1/2 for EFX and GMMS via Envy Cycle Elimination. Georgios Amanatidis, Apostolos Ntokos, E. Markakis. 2019, AAAI ...