Approximation and complexity of the optimization and existence problems for maximin share, proportional share, and minimax share allocation of indivisible goods | Autonomous Agents and Multi-Agent Systems Skip to main content
Springer Nature Link
Log in

Approximation and complexity of the optimization and existence problems for maximin share, proportional share, and minimax share allocation of indivisible goods

  • Published:
Autonomous Agents and Multi-Agent Systems Aims and scope Submit manuscript

Abstract

This paper is concerned with various types of allocation problems in fair division of indivisible goods, aiming at maximin share, proportional share, and minimax share allocations. However, such allocations do not always exist, not even in very simple settings with two or three agents. A natural question is to ask, given a problem instance, what is the largest value c for which there is an allocation such that every agent has utility of at least c times her fair share. We first prove that the decision problem of checking if there exists a minimax share allocation for a given problem instance is \(\mathrm {NP}\)-hard when the agents’ utility functions are additive. We then show that, for each of the three fairness notions, one can approximate c by a polynomial-time approximation scheme, assuming that the number of agents is fixed. Next, we investigate the restricted cases when utility functions have values in \(\{0,1\}\) only or are defined based on scoring vectors (Borda and lexicographic vectors), and we obtain several tractability results for these cases. Interestingly, we show that maximin share allocations can always be found efficiently with Borda utilities, which cannot be guaranteed for general additive utilities. In the nonadditive setting, we show that there exists a problem instance for which there is no c-maximin share allocation, for any constant c. We explore a class of symmetric submodular utilities for which there exists a tight \(\frac{1}{2}\)-maximin share allocation, and show how it can be approximated to within a factor of \(\nicefrac {1}{4}\).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (Japan)

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

Notes

  1. A PTAS for Maximin-Opt has already been given by Aziz et al. [5].

  2. Lorenz dominance (see, e.g, Golden and Perny [34], Endriss [28]) is related to majorization and it can be used when utility functions are not identical.

  3. Alternatively, one can model the problem as a max-flow problem and use a known polynomial-time algorithm for solving it.

  4. Note that Darmann and Klamler [25] consider Borda vectors of the form \((m-1,\ldots ,1,0)\), which slightly differs from our Borda vectors, \((m,\ldots ,2,1)\), which can be seen as an additive translation of the former one. However, as shown by Darmann and Klamler [25], proportionality is unchanged under such a translation.

  5. Note that in our original definition of lexicographic utilities in Sect. 6.2, it is required that k must be equal to j.

  6. We thank an anonymous reviewer for pointing us to this example, which is simpler than the one we used in the conference version [54].

References

  1. Amanatidis, G., Markakis, E., Nikzad, A., & Saberi, A. (2015). Approximation algorithms for computing maximin share allocations. In Proceedings of the 42nd International Colloquium on Automata, Languages, and Programming. Lecture Notes in Computer Science #9134 (pp. 39–51). Berlin: Springer.

    Chapter  Google Scholar 

  2. Asadpour, A., & Saberi, A. (2007). An approximation algorithm for max-min fair allocation of indivisible goods. In Proceedings of the 39th ACM Symposium on Theory of Computing (pp. 114–121). ACM.

  3. Aziz, H., Biró, P., Lang, J., Lesca, J., & Monnot, J. (2016). Optimal reallocation under additive and ordinal preferences. In: Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems (pp. 402–410). IFAAMAS.

  4. Aziz, H., Gaspers, S., Mackenzie, S., & Walsh, T. (2015). Fair assignment of indivisible objects under ordinal preferences. Artificial Intelligence, 227, 71–92.

    Article  MathSciNet  Google Scholar 

  5. Aziz, H., Rauchecker, G., Schryen, G., & Walsh, T. (2017). Algorithms for max-min share fair allocation of indivisible chores. In Proceedings of the 31th AAAI Conference on Artificial Intelligence (pp. 335–341). AAAI Press.

  6. Bansal, N., & Sviridenko, M. (2006). The Santa Claus problem. In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing (pp. 31–40). ACM.

  7. Barman, S., & Murthy, S. (2017). Approximation algorithms for maximin fair division. In: Proceedings of the 2017 ACM Conference on Economics and Computation (pp. 647–664). ACM.

  8. Baumeister, D., Bouveret, S., Lang, J., Nguyen, N., Nguyen, T., & Rothe, J. (2014). Scoring rules for the allocation of indivisible goods. In: Proceedings of the 21st European Conference on Artificial Intelligence (pp. 75–80). IOS Press.

  9. Baumeister, D., Bouveret, S., Lang, J., Nguyen, N., Nguyen, T., & Rothe, J. (2017). Positional scoring-based allocation of indivisible goods. Journal of Autonomous Agents and Multi-Agent Systems, 31(3), 628–655.

    Article  Google Scholar 

  10. Baumeister, D., Bouveret, S., Lang, J., Nguyen, T., Rothe, J., & Saffidine, A. (2013). Positional scoring rules for the allocation of indivisible goods. In Proceedings of the 11th European Workshop on Multi-Agent Systems.

  11. Bezáková, I., & Dani, V. (2005). Allocating indivisible goods. SIGecom Exchanges, 5(3), 11–18.

    Article  Google Scholar 

  12. Blackorby, C., & Donaldson, D. (1978). Measures of relative equality and their meaning in terms of social welfare. Journal of Economic Theory, 18(1), 59–80.

    Article  MathSciNet  Google Scholar 

  13. Bliem, B., Bredereck, R., & Niedermeier, R. (2016). Complexity of efficient and envy-free resource allocation: Few agents, resources, or utility levels. In Proceedings of the 25th International Joint Conference on Artificial Intelligence (pp. 102–108). AAAI Press/IJCAI.

  14. Bouveret, S., Cechlárová, K., Elkind, E., Igarashi, A., & Peters, D. (2017). Fair division of a graph. In: Proceedings of the 26th International Joint Conference on Artificial Intelligence (pp. 135–141). AAAI Press/IJCAI.

  15. Bouveret, S., Chevaleyre, Y., & Maudet, N. (2016). Fair allocation of indivisible goods. In F. Brandt, V. Conitzer, U. Endriss, J. Lang, & A. Procaccia (Eds.), Handbook of computational social choice, Chapter 12 (pp. 284–310). Cambridge: Cambridge University Press.

    Chapter  Google Scholar 

  16. Bouveret, S., & Lang, J. (2008). Efficiency and envy-freeness in fair division of indivisible goods: Logical representation and complexity. Journal of Artificial Intelligence Research, 32, 525–564.

    Article  MathSciNet  Google Scholar 

  17. Bouveret, S., & Lang, J. (2011). A general elicitation-free protocol for allocating indivisible goods. In: Proceedings of the 22nd International Joint Conference on Artificial Intelligence (pp. 73–78). AAAI Press/IJCAI.

  18. Bouveret, S., & Lemaître, M. (2016). Characterizing conflicts in fair division of indivisible goods using a scale of criteria. Journal of Autonomous Agents and Multi-Agent Systems, 30(2), 259–290.

    Article  Google Scholar 

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

    Article  Google Scholar 

  20. Caragiannis, I., Kurokawa, D., Moulin, H., Procaccia, A., Shah, N., & Wang, J. (2016). The unreasonable fairness of maximum Nash welfare. In Proceedings of the 17th ACM Conference on Economics and Computation (pp. 305–322). ACM.

  21. Chakrabarty, D., Chuzhoy, J., & Khanna, S. (2009). On allocating goods to maximize fairness. In Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science (pp. 107–116). IEEE.

  22. Chevaleyre, Y., Endriss, U., Estivie, S., & Maudet, N. (2008). Multiagent resource allocation in \(k\)-additive domains: Preference representation and complexity. Annals of Operations Research, 163(1), 49–62.

    Article  MathSciNet  Google Scholar 

  23. Chevaleyre, Y., Endriss, U., & Maudet, N. (2017). Distributed fair allocation of indivisible goods. Artificial Intelligence, 242, 1–22.

    Article  MathSciNet  Google Scholar 

  24. Cole, R., Gkatzelis, V., & Goel, G. (2013). Mechanism design for fair division: Allocating divisible items without payments. In Proceedings of the 14th ACM Conference on Electronic Commerce (pp. 251–268). ACM.

  25. Darmann, A., & Klamler, C. (2016). Proportional Borda allocations. Social Choice and Welfare, 47(3), 543–558.

    Article  MathSciNet  Google Scholar 

  26. Darmann, A., & Schauer, J. (2015). Maximizing Nash product social welfare in allocating indivisible goods. European Journal of Operational Research, 247(2), 548–559.

    Article  MathSciNet  Google Scholar 

  27. de Keijzer, B., Bouveret, S., Klos, T., & Zhang, Y. (2009). On the complexity of efficiency and envy-freeness in fair division of indivisible goods with additive preferences. In Proceedings of the 1st International Conference on Algorithmic Decision Theory. Lecture Notes in Computer Science #5783 (pp. 98–110). Berlin: Springer.

  28. Endriss, U. (2013). Reduction of economic inequality in combinatorial domains. In Proceedings of the 12th International Joint Conference on Autonomous Agents and Multiagent Systems (pp. 175–182). IFAAMAS.

  29. Erlebach, T., Kellerer, H., & Pferschy, U. (2002). Approximating multiobjective knapsack problems. Management Science, 48(12), 1603–1612.

    Article  Google Scholar 

  30. Feige, U., Mirrokni, V., & Vondrák, J. (2011). Maximizing non-monotone submodular functions. SIAM Journal on Computing, 40(4), 1133–1153.

    Article  MathSciNet  Google Scholar 

  31. Fujita, E., Lesca, J., Sonoda, A., Todo, T., & Yokoo, M. (2015). A complexity approach for core-selecting exchange with multiple indivisible goods under lexicographic preferences. In Proceedings of the 29th AAAI Conference on Artificial Intelligence (pp. 907–913). AAAI Press.

  32. Garey, M., & Johnson, D. (1979). Computers and intractability: A guide to the theory of NP-completeness. New York: W. H. Freeman and Company.

    MATH  Google Scholar 

  33. Ghodsi, M., HajiAghayi, M., Seddighin, M., Seddighin, S., & Yami, H. (2017). Fair allocation of indivisible goods: Improvement and generalization. Technical Report. arXiv:1704.00222v1 [cs.GT], Computing Research Repository (CoRR).

  34. Golden, B., & Perny, P. (2010). Infinite order Lorenz dominance for fair multiagent optimization. In Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems (pp. 383–390). IFAAMAS.

  35. Golovin, D. (2005). Max-min fair allocation of indivisible goods. Technical Report. CMU-CS-05-144, School of Computer Science, Carnegie Mellon University.

  36. Gourvès, L., & Monnot, J. (2017). Approximate maximin share allocations in matroids. In Proceedings of the 10th International Conference on Algorithms and Complexity. Lecture Notes in Computer Science #10236 (pp. 310–321). Berlin: Springer.

    MATH  Google Scholar 

  37. Gourvès, L., Monnot, J., & Tlilane, L. (2013). A matroid approach to the worst case allocation of indivisible goods. In Proceedings of the 23th International Joint Conference on Artificial Intelligence (pp. 136–142). AAAI Press/IJCAI.

  38. Gourvès, L., Monnot, J., & Tlilane, L. (2015). Worst case compromises in matroids with applications to the allocation of indivisible goods. Theoretical Computer Science, 589, 121–140.

    Article  MathSciNet  Google Scholar 

  39. Graham, R. L. (1969). Bounds on multiprocessing timing anomalies. SIAM Journal of Applied Mathematics, 17(2), 416–429.

    Article  MathSciNet  Google Scholar 

  40. Heinen, T., Nguyen, N., & Rothe, J. (2015). Fairness and rank-weighted utilitarianism in resource allocation. In Proceedings of the 4th International Conference on Algorithmic Decision Theory. Lecture Notes in Artificial Intelligence #9346 (pp. 521–536). Berlin: Springer.

    Chapter  Google Scholar 

  41. Hill, T. (1987). Partitioning general probability measures. The Annals of Probability, 15(2), 804–813.

    Article  MathSciNet  Google Scholar 

  42. Hochbaum, D. S., & Shmoys, D. B. (1987). Using dual approximation algorithms for scheduling problems theoretical and practical results. Journal of the ACM, 34(1), 144–162.

    Article  MathSciNet  Google Scholar 

  43. Kurokawa, D., Procaccia, A., & Wang, J. (2016). When can the maximin share guarantee be guaranteed? In Proceedings of the 30th AAAI Conference on Artificial Intelligence (pp. 523–529). AAAI Press.

  44. Lang, J., & Rothe, J. (2015). Fair division of indivisible goods. In J. Rothe (Ed.), Economics and computation: An introduction to algorithmic game theory, computational social choice, and fair division, Springer Texts in Business and Economics, Chap. 8 (pp. 493–550). Berlin: Springer.

    Google Scholar 

  45. Lesca, J., & Perny, P. (2010). LP Solvable Models for Multiagent Fair Allocation Problems. In Proceedings of the 19th European Conference on Artificial Intelligence (pp. 393–398). IOS Press.

  46. Markakis, E., & Psomas, C. (2011). On worst-case allocations in the presence of indivisible goods. In Proceedings of the 7th International Workshop on Internet & Network Economics Lecture Notes in Computer Science #7090 (pp. 278–289). Berlin: Springer.

    Google Scholar 

  47. Marshall, A., Olkin, I., & Arnold, B. (2010). Inequalities: Theory of majorization and its applications. Berlin: Springer.

    MATH  Google Scholar 

  48. Moulin, H. (1988). Axioms of cooperative decision making. Cambridge: Cambridge University Press.

    Book  Google Scholar 

  49. Moulin, H. (1990). Uniform externalities: Two axioms for fair allocation. Journal of Public Economics, 43(3), 305–326.

    Article  Google Scholar 

  50. Nash, J. (1950). The bargaining problem. Econometrica, 18(2), 155–162.

    Article  MathSciNet  Google Scholar 

  51. Nemirovski, A., & Todd, M. (2008). Interior-point methods for optimization. Acta Numerica, 17, 191–234.

    Article  MathSciNet  Google Scholar 

  52. Nguyen, N., Baumeister, D., & Rothe, J.: Strategy-proofness of scoring allocation correspondences for indivisible goods. Social Choice and Welfare (forthcoming). A preliminary version appeared in Proceedings of the 24th International Joint Conference on Artificial Intelligence (IJCAI 2015) (pp. 1127–1133). AAAI Press/IJCAI.

  53. Nguyen, N., Nguyen, T., Roos, M., & Rothe, J. (2014). Computational complexity and approximability of social welfare optimization in multiagent resource allocation. Journal of Autonomous Agents and Multi-Agent Systems, 28(2), 256–289.

    Article  Google Scholar 

  54. Nguyen, N., Nguyen, T., & Rothe, J. (2017). Approximate solutions to max-min fair and proportionally fair allocations of indivisible goods. In Proceedings of the 16th International Conference on Autonomous Agents and Multiagent Systems (pp. 262–271). IFAAMAS.

  55. Nguyen, T., Roos, M., & Rothe, J. (2013). A survey of approximability and inapproximability results for social welfare optimization in multiagent resource allocation. Annals of Mathematics and Artificial Intelligence, 68(1–3), 65–90.

    Article  MathSciNet  Google Scholar 

  56. Papadimitriou, C. (1995). Computational complexity (2nd ed.). Boston: Addison-Wesley.

    MATH  Google Scholar 

  57. Porschen, S., Schmidt, T., Speckenmeyer, E., & Wotzlaw, A. (2014). XSAT and NAE-SAT of linear CNF classes. Discrete Applied Mathematics, 167, 1–14.

    Article  MathSciNet  Google Scholar 

  58. Procaccia, A., & Wang, J. (2014). Fair enough: Guaranteeing approximate maximin shares. In Proceedings of the 15th ACM Conference on Economics and Computation (pp. 675–692). ACM.

  59. Ramezani, S., & Endriss, U. (2010). Nash social welfare in multiagent resource allocation. In Agent-Mediated Electronic Commerce. Designing Trading Strategies and Mechanisms for Electronic Markets. AMEC 2009, TADA 2009. Lecture Notes in Business Information Processing #59 (pp. 117–131). Berlin: Springer.

    Google Scholar 

  60. Rothe, J. (2005). Complexity theory and cryptology: An introduction to cryptocomplexity. EATCS Texts in Theoretical Computer Science. Berlin: Springer.

    Google Scholar 

  61. Segal-Halevi, E., Aziz, H., & Hassidim, A. (2017). Fair allocation based on diminishing differences. In Proceedings of the 26th International Joint Conference on Artificial Intelligence (pp. 1254–1261). AAAI Press/IJCAI.

  62. Steinhaus, H. (1948). The problem of fair division. Econometrica, 16(1), 101–104.

    Google Scholar 

  63. Vazirani, V. (2003). Approximation algorithms (2nd ed.). Berlin: Springer.

    Book  Google Scholar 

Download references

Acknowledgements

We thank the anonymous JAAMAS, ADT 2015, and AAMAS 2017 reviewers for their helpful comments. We also thank Khaled Elbassioni for very helpful discussions. This work was supported in part by DFG Grant RO 1202/14-2, and by Vietnam National Foundation for Science and Technology Development (NAFOSTED Project No. 102.01-2015.33).

Author information

Authors and Affiliations

  1. Saarland University and IMPRS-CS, Saarland Informatics Campus, 66123, Saarbrücken, Germany

    Tobias Heinen

  2. Heinrich-Heine-Universität Düsseldorf, Universitätsstr. 1, 40225, Düsseldorf, Germany

    Nhan-Tam Nguyen & Jörg Rothe

  3. Hai Phong University, Hai Phong, Vietnam

    Trung Thanh Nguyen

Authors
  1. Tobias Heinen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nhan-Tam Nguyen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Trung Thanh Nguyen
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Jörg Rothe
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Trung Thanh Nguyen.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Preliminary versions of parts of this paper appear in the proceedings of the 4th International Conference on Algorithmic Decision Theory [40] and of the 16th International Conference on Autonomous Agents and Multiagent Systems [54]. This paper presents novel results that are not contained in [40, 54], including Theorems 2, 5, and 9 and its corollaries. Also, it contains the missing proof of Theorem 10 and of Proposition 7, which were not given in [54] due to space constraints.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Heinen, T., Nguyen, NT., Nguyen, T.T. et al. Approximation and complexity of the optimization and existence problems for maximin share, proportional share, and minimax share allocation of indivisible goods. Auton Agent Multi-Agent Syst 32, 741–778 (2018). https://doi.org/10.1007/s10458-018-9393-0

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10458-018-9393-0

Keywords

Search

Navigation