Fair Allocation of Indivisible Goods: Improvement

DOI10.1287/moor.2020.1096zbMath1469.91028OpenAlexW3145017027MaRDI QIDQ4958554

Mohammad Ghodsi, Masoud Seddighin, Saeed Seddighin, Hadi Yami, Mohammad Taghi Hajiaghayi

Publication date: 14 September 2021

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.2020.1096

zbMATH Keywords

fairnessapproximationmaximin share

Mathematics Subject Classification ID

Approximation algorithms (68W25) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items (10)

Allocating indivisible goods to strategic agents: pure Nash equilibria and fairness ⋮ A tight negative example for MMS fair allocations ⋮ Approximating Nash social welfare under binary XOS and binary subadditive valuations ⋮ Ordinal Maximin Share Approximation for Goods ⋮ Two birds with one stone: fairness and welfare via transfers ⋮ Existence of EFX for two additive valuations ⋮ Fair division of indivisible goods: recent progress and open questions ⋮ On best-of-both-worlds fair-share allocations ⋮ Fair allocation of indivisible items with conflict graphs ⋮ The Price of Connectivity in Fair Division

Cites Work

• Unnamed Item
• An efficient polynomial time approximation scheme for load balancing on uniformly related machines
• The fair division of hereditary set systems
• How to Cut A Cake Fairly
• Approximation Algorithms for Computing Maximin Share Allocations
• Fair Enough

This page was built for publication: Fair Allocation of Indivisible Goods: Improvement