Asymptotic existence of fair divisions for groups

DOI10.1016/j.mathsocsci.2017.05.006zbMath1415.91182arXiv1706.08219OpenAlexW2730072800WikidataQ56388119 ScholiaQ56388119MaRDI QIDQ1680744

Warut Suksompong, Pasin Manurangsi

Publication date: 16 November 2017

Published in: Mathematical Social Sciences (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1706.08219

zbMATH Keywords

envy-free divisionsfair divisions for groupsmultiple players

Mathematics Subject Classification ID

Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items (13)

Almost envy-freeness for groups: improved bounds via discrepancy theory ⋮ Maximum Nash welfare and other stories about EFX ⋮ Efficient Fair Division with Minimal Sharing ⋮ Fairness for multi-self agents ⋮ Almost envy-freeness in group resource allocation ⋮ When Do Envy-Free Allocations Exist? ⋮ Fairly allocating contiguous blocks of indivisible items ⋮ Approximate maximin shares for groups of agents ⋮ Democratic fair allocation of indivisible goods ⋮ Fair cake-cutting among families ⋮ Closing Gaps in Asymptotic Fair Division ⋮ Computing a small agreeable set of indivisible items ⋮ Consensus Halving for Sets of Items

Cites Work

• Asymptotic existence of proportionally fair allocations
• Noise stability of functions with low influences: invariance and optimality
• Approximate maximin shares for groups of agents
• The undercut procedure: an algorithm for the envy-free division of indivisible items
• Bidding for envy-freeness: a procedural approach to \(n\)-player fair-division problems
• Two-Person Fair Division of Indivisible Items: An Efficient, Envy-Free Algorithm
• Approximation Algorithms for Computing Maximin Share Allocations
• How to Cut A Cake Fairly
• How to Cut a Cake Fairly

This page was built for publication: Asymptotic existence of fair divisions for groups