Thinned Quantile Shares are Universally Feasible
Vishesh Jain, Clayton Mizgerd, Shyam Ravichandran

TL;DR
This paper introduces thinned quantile shares, a new class of fair division benchmarks, proving their universal feasibility unconditionally for certain parameters, thus improving upon previous results and removing conditional assumptions.
Contribution
It defines the c-thinned quantile share, proves its universal feasibility for some constant c, and refines prior results by removing the rainbow EMC assumption.
Findings
Existence of a universal constant c > 0 for which the c-thinned e^{-c}-quantile share is universally feasible.
The c-thinned q-quantile share can be infeasible for q > e^{-c}.
Prior to this, only Feige's residual maximin share was known to be universally feasible.
Abstract
Quantile shares, introduced by Babichenko, Feldman, Holzman, and Narayan [STOC 2024], offer an ordinal, self-maximizing, and interpretable benchmark for fair division of indivisible goods, but their universal feasibility is known only conditional on the rainbow Erd\H{o}s matching conjecture (EMC). Specifically, Babichenko et al. showed that assuming the rainbow EMC in the near-perfect matching regime, the -quantile share is universally feasible. In contrast, a simple argument shows that the -quantile share can be infeasible for any . We introduce a one-parameter refinement of quantile shares, the -thinned quantile share, obtained by thinning the inclusion probability in the random benchmark bundle by a factor of for a fixed constant . Our main result is that there exists a universal constant for which the -thinned -quantile share…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
