A tight negative example for MMS fair allocations

Eric Budish: The combinatorial assignment problem: Approximate competitive equilibrium from equal incomes. Journal of Political Economy 119 (6), 1061–1103 (2011)

2011

Earlier work this paper cites.

Sylvain Bouveret, Michel Lemaitre: Characterizing conflicts in fair division of indivisible goods using a scale of criteria. Autonomous Agents and Multi-Agent Systems. 30 (2): 259, (2015)

2015

Earlier work this paper cites.

Georgios Amanatidis, Evangelos Markakis, Afshin Nikzad, Amin Saberi: Approximation Algorithms for Computing Maximin Share Allocations. ACM Trans. Algorithms 13(4): 52:1–52:28 (2017)

2017

Earlier work this paper cites.

Haris Aziz, Gerhard Rauchecker, Guido Schryen, Toby Walsh: Algorithms for Max-Min Share Fair Allocation of Indivisible Chores. AAAI 2017: 335–341

2017

Earlier work this paper cites.

Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Masoud Seddighin, Saeed Seddighin, Hadi Yami: Fair Allocation of Indivisible Goods: Improvements and Generalizations. EC 2018: 539–556

2018

Cited alongside, same era.

David Kurokawa, Ariel D. Procaccia, Junxing Wang: Fair Enough: Guaranteeing Approximate Maximin Shares. J. ACM 65(2): 8:1–8:27 (2018)

2018

Cited alongside, same era.

Laurent Gourves, Jerome Monnot: On maximin share allocations in matroids. Theor. Comput. Sci. 754: 50–64 (2019)

2019

Cited alongside, same era.

Xin Huang, Pinyan Lu: An algorithmic framework for approximating maximin share allocation of chores. CoRR abs/1907.04505 (2019)

Original

2019

Later among the works it cites.

Siddharth Barman, Sanath Kumar Krishnamurthy: Approximation Algorithms for Maximin Fair Division. ACM Trans. Economics and Comput. 8(1): 5:1–5:28 (2020)

2020

Later among the works it cites.

Jugal Garg, Setareh Taki: An Improved Approximation Algorithm for Maximin Shares. EC 2020: 379–380

2020

Later among the works it cites.