The fair division of hereditary set systems

DOI10.1007/978-3-030-04612-5_20zbMath1443.91177arXiv1812.09561OpenAlexW3162759032MaRDI QIDQ2190407

Adrian Vetta, Zhentao Li

Publication date: 18 June 2020

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

zbMATH Keywords

polynomial time algorithmfair divisionindivisible itemshereditary set systems

Mathematics Subject Classification ID

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

Related Items (5)

Approximating Nash social welfare under binary XOS and binary subadditive valuations ⋮ On Fair Division under Heterogeneous Matroid Constraints ⋮ Improved maximin guarantees for subadditive and fractionally subadditive fair allocation problem ⋮ An improved approximation algorithm for maximin shares ⋮ Fair Allocation of Indivisible Goods: Improvement

Cites Work

• Unnamed Item
• Unnamed Item
• A polynomial-time approximation scheme for maximizing the minimum machine completion time
• Approximation Algorithms for Computing Maximin Share Allocations
• Fair Enough
• Fair Allocation of Indivisible Goods to Asymmetric Agents

This page was built for publication: The fair division of hereditary set systems