the Envy Cycle Elimination
No mentions found
This entity hasn't been tracked yet, or Iris is still building its knowledge base.
Related Articles from SNS
Optimizing the Envy Cycle Elimination Algorithm
arXiv:2606.02233v1 Announce Type: new Abstract: In the fair allocation of indivisible goods, a widely used notion of fairness is envy-freeness up to one good (EF1). A classical way to compute an EF1 allocation is the envy cycle elimination (ECE) algorithm, which iteratively assigns a good to an unenvied agent and, after each assignment, resolves any resulting envy cycle. Although the ECE algorithm always produces an EF1 allocation, it leaves considerable freedom in choosing both the next...
Best-of-Both-Worlds Fairness of the Envy-Cycle-Elimination Algorithm
arXiv:2410.08986v2 Announce Type: replace Abstract: We consider the problem of fairly dividing indivisible goods among agents with additive valuations. It is known that an Epistemic EFX and $2/3$-MMS allocation can be obtained using the Envy-Cycle-Elimination (ECE) algorithm. In this work, we explore whether this algorithm can be randomized to also ensure ex-ante proportionality.
Envy Cycle Elimination with Strategic Agents: Best Responses and Fairness Guarantees
arXiv:2605.31253v1 Announce Type: new Abstract: With strong evidence in the literature showing that fairness and truthfulness are incompatible, there is a recent line of work focusing on the fairness properties of equilibria of simple fair division mechanisms, especially Round-Robin. We consider the Envy Cycle Elimination (E-C-E) procedure of Lipton et al.