skip to main content
10.1145/3328526.3329649acmconferencesArticle/Chapter ViewAbstractPublication PagesecConference Proceedingsconference-collections
research-article

High-Multiplicity Fair Allocation: Lenstra Empowered by N-fold Integer Programming

Published:17 June 2019Publication History

ABSTRACT

We study the (parameterized) computational complexity of problems in the context of fair allocations of indivisible goods. More specifically, we show fixed-parameter tractability results for a broad set of problems concerned with envy-free, Pareto-efficient allocations of items (with agent-specific utility functions) to agents. In principle, this implies efficient exact algorithms for these in general computationally intractable problems whenever we face instances with few agents and low maximum (absolute) utility values. This holds true also in high-multiplicity settings where we may have high numbers of identical items. On the technical side, our approach provides algorithmic meta-theorems covering a rich set of fair allocation problems in the additive preferences model. To achieve this, our main technical contribution is to make an elaborate use of tools from integer linear programming. More specifically, we exploit results originally going back to a famous theorem of Lenstra [Math. Oper. Res. 1983] concerning (the fixed-parameter tractability of) Integer Linear Programs (ILPs) with bounded dimension (that is, the dimension shall be considered as a (small) parameter) and the more recent framework of (combinatorial) N-fold ILPs. We reveal and exploit a fruitful interaction between these two cornerstones in the theory of integer linear programming, which may be of independent interest in applications going beyond fair allocations.

Skip Supplemental Material Section

Supplemental Material

p505-bredereck.mp4

References

  1. Martin Aleksandrov and Toby Walsh. 2018. Group Envy Freeness and Group Pareto Efficiency in Fair Division with Indivisible Items. In Proceedings of the 41st German Conference on Artificial Intelligence (KI '18). Springer, 57--72.Google ScholarGoogle ScholarCross RefCross Ref
  2. Georgios Amanatidis, Georgios Birmpas, and Vangelis Markakis. 2018. Comparing Approximate Relaxations of Envy-Freeness. In Proceedings of the 27th International Joint Conference on Artificial Intelligence (IJCAI '18) . AAAI Press, 42--48.Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Siddharth Barman, Sanath Kumar Krishnamurthy, and Rohit Vaish. 2018. Finding Fair and Efficient Allocations. In Proceedings of the 19th ACM Conference on Economics and Computation (EC '18). ACM, 557--574. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Berhard Bliem, Robert Bredereck, and Rolf Niedermeier. 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 (IJCAI '16). AAAI Press, 102--108. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Sylvain Bouveret, Yann Chevaleyre, and Nicolas Maudet. 2015. Fair Allocation of Indivisible Goods. In Handbook of Computational Social Choice, F. Brandt, V. Conitzer, U. Endriss, J. Lang, and A. D. Procaccia (Eds.). Cambridge University Press, Chapter 12.Google ScholarGoogle Scholar
  6. Sylvain Bouveret and Jérôme Lang. 2008. Efficiency and Envy-freeness in Fair Division of Indivisible Goods: Logical Representation and Complexity. Journal of Artificial Intelligence Research, Vol. 32, 1 (2008), 525--564. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Robert Bredereck, Andrzej Kaczmarczyk, and Rolf Niedermeier. 2018. Envy-Free Allocations Respecting Social Networks. In Proceedings of the 17th International Conference on Autonomous Agents and Multiagent Systems (AAMAS '18) . IFAAMAS, 283--291. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Eric Budish. 2011. The Combinatorial Assignment Problem: Approximate Competitive Equilibrium from Equal Incomes. Journal of Political Economy, Vol. 119, 6 (2011), 1061--1103.Google ScholarGoogle ScholarCross RefCross Ref
  9. Ioannis Caragiannis, David Kurokawa, Hervé Moulin, Ariel D. Procaccia, Nisarg Shah, and Junxing Wang. 2016. The Unreasonable Fairness of Maximum Nash Welfare. In Proceedings of the 17th ACM Conference on Economics and Computation (EC '16). ACM, 305--322.Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Marek Cygan, Fedor V. Fomin, Łukasz Kowalik, Daniel Lokshtanov, Dá niel Marx, Marcin Pilipczuk, Michał Pilipczuk, and Saket Saurabh. 2015. Parameterized Algorithms .Springer. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Rodney G. Downey and Michael R. Fellows. 2012. Parameterized Complexity .Springer Publishing Company, Incorporated. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Friedrich Eisenbrand, Christoph Hunkenschrö der, Kim-Manuel Klein, Martin Koutecký, Asaf Levin, and Shmuel Onn. 2019. An Algorithmic Theory of Integer Programming. CoRR, Vol. abs/1904.01361 (2019). arxiv: 1904.01361 http://arxiv.org/abs/1904.01361Google ScholarGoogle Scholar
  13. Friedrich Eisenbrand, Christoph Hunkenschröder, and Kim-Manuel Klein. 2018. Faster Algorithms for Integer Programs with Block Structure. In Proceedings of the 45th International Colloquium on Automata, Languages, and Programming (ICALP '18), Vol. 107. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 49:1--49:13.Google ScholarGoogle Scholar
  14. Jö rg Flum and Martin Grohe. 2006. Parameterized Complexity Theory .Springer.Google ScholarGoogle Scholar
  15. András Frank and Éva Tardos. 1987. An application of simultaneous Diophantine approximation in combinatorial optimization. Combinatorica, Vol. 7, 1 (1987), 49--65. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Raymond Hemmecke, Matthias Kö ppe, and Robert Weismantel. 2010. A Polynomial-Time Algorithm for Optimizing over N-Fold 4-Block Decomposable Integer Programs. In Proceedings of the 14th International Conference on Integer Programming and Combinatorial Optimization (IPCO '10) . Springer, 219--229. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Raymond Hemmecke, Shmuel Onn, and Lyubov Romanchuk. 2013. N-Fold integer programming in cubic time. Mathematical Programming, Vol. 137, 1--2 (2013), 325--341.Google ScholarGoogle ScholarCross RefCross Ref
  18. Ravi Kannan. 1987. Minkowski's Convex Body Theorem and Integer Programming. Mathematics of Operations Research, Vol. 12, 3 (1987), 415--440. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Bart noopsortKeijzerde Keijzer, Sylvain Bouveret, Tomas Klos, and Yingqian Zhang. 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 (ADT '09). Springer, 98--110. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. Duvsan Knop and Martin Koutecký. 2018. Scheduling meets n-fold integer programming. Journal of Scheduling, Vol. 21, 5 (2018), 493--503.Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. Duvs an Knop, Martin Koutecký, and Matthias Mnich. 2017a. Combinatorial n-fold Integer Programming and Applications. In Proceedings of the 25th Annual European Symposium on Algorithms (ESA '17), Vol. 87. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 54:1--54:14.Google ScholarGoogle Scholar
  22. Duvs an Knop, Martin Koutecký, and Matthias Mnich. 2017b. Voting and Bribing in Single-Exponential Time. In Proceedings of the 34th International Symposium on Theoretical Aspects of Computer Science (STACS '17) . Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 46:1--46:14.Google ScholarGoogle Scholar
  23. Duvs an Knop, Martin Koutecký, and Matthias Mnich. 2018. A Unifying Framework for Manipulation Problems. In Proceedings of the 17th International Conference on Autonomous Agents and Multiagent Systems (AAMAS '18) . IFAAMAS, 256--264. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. Duvs an Knop, Michał Pilipczuk, and Marcin Wrochna. 2019. Tight Complexity Lower Bounds for Integer Linear Programming with Few Constraints. In 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019), Vol. 126. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 44:1--44:15.Google ScholarGoogle Scholar
  25. Martin Koutecký, Asaf Levin, and Shmuel Onn. 2018. A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs. In Proceedings of the 45th International Colloquium on Automata, Languages, and Programming (ICALP '18). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 85:1--85:14.Google ScholarGoogle Scholar
  26. Hendrik W. Lenstra, Jr. 1983. Integer Programming with a Fixed Number of Variables. Mathematics of Operations Research, Vol. 8, 4 (1983), 538--548. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. Richard J. Lipton, Evangelos Markakis, Elchanan Mossel, and Amin Saberi. 2004. On Approximately Fair Allocations of Indivisible Goods. In Proceedings of the 5th ACM Conference on Electronic Commerce (EC '04). ACM, 125--131. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. Jesú s A. De Loera, Raymond Hemmecke, and Matthias Kö ppe. 2013. Algebraic and Geometric Ideas in the Theory of Discrete Optimization. MOS-SIAM Series on Optimization, Vol. 14. SIAM . Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. Matthias Mnich and Andreas Wiese. 2015. Scheduling and fixed-parameter tractability. Mathematical Programming, Vol. 154, 1--2 (2015), 533--562. Google ScholarGoogle ScholarDigital LibraryDigital Library
  30. Jaroslav Nevs etvr il and Patrice Ossona de Mendez. 2012. Sparsity - Graphs, Structures, and Algorithms. Algorithms and Combinatorics, Vol. 28. Springer. Google ScholarGoogle ScholarDigital LibraryDigital Library
  31. Rolf Niedermeier. 2006. Invitation to Fixed-Parameter Algorithms .Oxford University Press.Google ScholarGoogle Scholar
  32. Shmuel Onn. 2010. Nonlinear discrete optimization. Zurich Lectures in Advanced Mathematics, European Mathematical Society (2010).Google ScholarGoogle Scholar
  33. Christos H. Papadimitriou. 1981. On the complexity of integer programming. Journal of the ACM, Vol. 28, 4 (1981), 765--768. Google ScholarGoogle ScholarDigital LibraryDigital Library
  34. Benjamin Plaut and Tim Roughgarden. 2018. Almost Envy-freeness with General Valuations. In Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '18). SIAM, 2584--2603. Google ScholarGoogle ScholarDigital LibraryDigital Library
  35. Ariel D. Procaccia and Junxing Wang. 2014. Fair Enough: Guaranteeing Approximate Maximin Shares. In Proceedings of the 15th ACM Conference on Economics and Computation (EC '14). ACM, 675--692. Google ScholarGoogle ScholarDigital LibraryDigital Library
  36. Alexander Schrijver. 1986. Theory of Linear and Integer Programming .John Wiley & Sons, Inc., New York, NY, USA. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. High-Multiplicity Fair Allocation: Lenstra Empowered by N-fold Integer Programming

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in
        • Published in

          cover image ACM Conferences
          EC '19: Proceedings of the 2019 ACM Conference on Economics and Computation
          June 2019
          947 pages
          ISBN:9781450367929
          DOI:10.1145/3328526

          Copyright © 2019 ACM

          Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 17 June 2019

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • research-article

          Acceptance Rates

          EC '19 Paper Acceptance Rate106of382submissions,28%Overall Acceptance Rate664of2,389submissions,28%

          Upcoming Conference

          EC '24
          The 25th ACM Conference on Economics and Computation
          July 8 - 11, 2024
          New Haven , CT , USA

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader