An Algorithmic Framework for Approximating Maximin Share Allocation of Chores

In this paper, we consider the problem of how to fairly dividing $m$ indivisible chores among $n$ agents. The fairness measure we considered here is the maximin share. The previous best known result is that there always exists a $\frac{4}{3}$ approximation maximin share allocation. With a novel algorithm, we can always find a $\frac{11}{9}$ approximation maximin share allocation for any instances. We also discuss how to improve the efficiency of the algorithm and its connection to the job scheduling problem.

[1]  Klaus Jansen,et al.  Closing the Gap for Makespan Scheduling via Sparsification Techniques , 2016, ICALP.

[2]  Ioannis Caragiannis,et al.  Fair allocation of combinations of indivisible goods and chores , 2018, ArXiv.

[3]  Kurt Mehlhorn,et al.  A Little Charity Guarantees Almost Envy-Freeness , 2019, SODA.

[4]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[5]  Mohammad Taghi Hajiaghayi,et al.  Envy-free Chore Division for An Arbitrary Number of Agents , 2018, SODA.

[6]  Sylvain Bouveret,et al.  Characterizing conflicts in fair division of indivisible goods using a scale of criteria , 2016, Autonomous Agents and Multi-Agent Systems.

[7]  Ariel D. Procaccia,et al.  The Unreasonable Fairness of Maximum Nash Welfare , 2016, EC.

[8]  Yann Chevaleyre,et al.  Reaching Envy-Free States in Distributed Negotiation Settings , 2007, IJCAI.

[9]  N. Alon,et al.  Approximation schemes for scheduling on parallel machines , 1998 .

[10]  Jugal Garg,et al.  Approximating Maximin Share Allocations , 2019, SOSA.

[11]  Jugal Garg,et al.  An Improved Approximation Algorithm for Maximin Shares , 2019, EC.

[12]  Bo Li,et al.  Strategyproof and Approximately Maxmin Fair Share Allocation of Chores , 2019, IJCAI.

[13]  David S. Johnson,et al.  Near-optimal bin packing algorithms , 1973 .

[14]  Ronald L. Graham,et al.  Bounds for certain multiprocessing anomalies , 1966 .

[15]  Haris Aziz,et al.  A Discrete and Bounded Envy-Free Cake Cutting Protocol for Any Number of Agents , 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).

[16]  Toby Walsh,et al.  Fair allocation of indivisible goods and chores , 2019, Autonomous Agents and Multi-Agent Systems.

[17]  Ronald L. Graham,et al.  Bounds on Multiprocessing Timing Anomalies , 1969, SIAM Journal of Applied Mathematics.

[18]  Xin Huang,et al.  Envy-Freeness Up to Any Item with High Nash Welfare: The Virtue of Donating Items , 2019, EC.

[19]  Jack M. Robertson,et al.  Cake-cutting algorithms - be fair if you can , 1998 .

[20]  Siddharth Barman,et al.  Approximation Algorithms for Maximin Fair Division , 2017, EC.

[21]  Jörg Rothe,et al.  Minimizing envy and maximizing average Nash social welfare in the allocation of indivisible goods , 2014, Discret. Appl. Math..

[22]  Ioannis Caragiannis,et al.  Knowledge, Fairness, and Social Constraints , 2018, AAAI.

[23]  D. Foley.  Resource allocation and the public sector , 1967 .

[24]  K. Mehlhorn,et al.  EFX Exists for Three Agents , 2020, EC.

[25]  Hervé Moulin,et al.  Competitive Division of a Mixed Manna , 2017, ArXiv.

[26]  Evangelos Markakis,et al.  Approximation Algorithms for Computing Maximin Share Allocations , 2015, ICALP.

[27]  M. Yue.  A simple proof of the inequality FFD (L) ≤ 11/9 OPT (L) + 1, ∀L for the FFD bin-packing algorithm , 1991 .

[28]  Hervé Moulin,et al.  Fair division and collective welfare , 2003 .

[29]  Eric Budish.  The Combinatorial Assignment Problem: Approximate Competitive Equilibrium from Equal Incomes , 2011, Journal of Political Economy.

[30]  György Dósa,et al.  The Tight Bound of First Fit Decreasing Bin-Packing Algorithm Is FFD(I) <= 11/9OPT(I) + 6/9 , 2007, ESCAPE.

[31]  Elchanan Mossel,et al.  On approximately fair allocations of indivisible goods , 2004, EC '04.

[32]  Tim Roughgarden,et al.  Almost Envy-Freeness with General Valuations , 2017, SODA.

[33]  Rohit Vaish,et al.  Finding Fair and Efficient Allocations , 2017, EC.

[34]  Mohammad Ghodsi,et al.  Fair Allocation of Indivisible Goods: Improvements and Generalizations , 2017, EC.

[35]  Klaus Jansen,et al.  An EPTAS for Scheduling Jobs on Uniform Processors: Using an MILP Relaxation with a Constant Number of Integral Variables , 2009, SIAM J. Discret. Math..

[36]  Bo Li,et al.  Weighted Maxmin Fair Share Allocation of Indivisible Chores , 2019, IJCAI.

[37]  Brenda S. Baker,et al.  A New Proof for the First-Fit Decreasing Bin-Packing Algorithm , 1985, J. Algorithms.

[38]  David B. Shmoys,et al.  Using dual approximation algorithms for scheduling problems: Theoretical and practical results , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[39]  Ariel D. Procaccia.  Cake Cutting Algorithms , 2016, Handbook of Computational Social Choice.

[40]  David S. Johnson,et al.  A 71/60 theorem for bin packing , 1985, J. Complex..

[41]  Toby Walsh,et al.  Algorithms for Max-Min Share Fair Allocation of Indivisible Chores , 2017, AAAI.