REVIEW 1 cited by
Best-of-Both-Worlds Fairness of the Envy-Cycle-Elimination Algorithm
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
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. For two agents, we show that a randomized variant of ECE can compute an ex-post EFX and ex-ante envy-free allocation in near-linear time. However, for three agents, we show that several natural randomization methods for ECE fail to achieve ex-ante proportionality.
Forward citations
Cited by 1 Pith paper
-
Probing EFX via PMMS: (Non-)Existence Results in Discrete Fair Division
The paper proves a three-agent EFX/PMMS separation and claims PMMS existence for binary-valued and pair-demand valuations, plus EFX for personalized bivalued valuations.
Discussion (0). Continue with ORCID to comment.