Closing Gaps in Asymptotic Fair Division
From MaRDI portal
Publication:4986806
DOI10.1137/20M1353381zbMath1461.91156arXiv2004.05563MaRDI QIDQ4986806
Pasin Manurangsi, Warut Suksompong
Publication date: 28 April 2021
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2004.05563
Related Items (6)
Almost envy-freeness for groups: improved bounds via discrepancy theory ⋮ Fixing knockout tournaments with seeds ⋮ Keep your distance: land division with separation ⋮ Fair division of indivisible goods: recent progress and open questions ⋮ The price of fairness for indivisible goods ⋮ The Price of Connectivity in Fair Division
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Asymptotic existence of proportionally fair allocations
- On the number of almost envy-free allocations
- Asymptotic existence of fair divisions for groups
- Approximate maximin shares for groups of agents
- Differential equations for random processes and random graphs
- Multiple birds with one stone: beating 1/2 for EFX and GMMS via envy cycle elimination
- Almost envy-freeness in group resource allocation
- Democratic fair allocation of indivisible goods
- Envy-freeness in house allocation problems
- Algorithms for the Assignment and Transportation Problems
- Topological sorting of large networks
- How to Cut A Cake Fairly
- How to Cut a Cake Fairly
- Approximation Algorithms for Computing Maximin Share Allocations
- Fair Allocation of Indivisible Goods to Asymmetric Agents
- Almost Envy-Freeness with General Valuations
- When Do Envy-Free Allocations Exist?
- A Little Charity Guarantees Almost Envy-Freeness
- Random Matching Under Dichotomous Preferences
This page was built for publication: Closing Gaps in Asymptotic Fair Division
