Best-of-Both-Worlds Fair Allocation of Indivisible and Mixed Goods
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:RYPKSOF7record.jsonopen to challenge →
read the original abstract
We study the problem of fairly allocating either a set of indivisible goods or a set of mixed divisible and indivisible goods (i.e., mixed goods) to agents with additive utilities, taking the best-of-both-worlds perspective of guaranteeing fairness properties both ex ante and ex post. The ex-post fairness notions considered in this paper are relaxations of envy-freeness, specifically, EFX for indivisible-goods allocation, and EFM for mixed-goods allocation. For two agents, we show that there is a polynomial-time randomized algorithm that achieves ex-ante envy-freeness and ex-post EFX / EFM simultaneously. For $n$ agents with bi-valued utilities, we show there exist randomized allocations that are (i) ex-ante proportional and ex-post EFM, and (ii) ex-ante envy-free, ex-post EFX, and ex-post fractionally Pareto optimal.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
Approximate Maximin Share with Subjective Divisibility: Beating the 1/2 Barrier
Under subjective divisibility, MMS approximation is 2/3-optimal for unary valuations, 5/9 in general, and 2/3 for up to four agents via new algorithms.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.