{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:29:13Z","timestamp":1750220953230,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":36,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,6,17]],"date-time":"2019-06-17T00:00:00Z","timestamp":1560729600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["NI 369\/19, BR 5207\/1, NI 369\/15"],"award-info":[{"award-number":["NI 369\/19, BR 5207\/1, NI 369\/15"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Czech Science Foundation","award":["17-20065S"],"award-info":[{"award-number":["17-20065S"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,6,17]]},"DOI":"10.1145\/3328526.3329649","type":"proceedings-article","created":{"date-parts":[[2019,6,21]],"date-time":"2019-06-21T12:45:07Z","timestamp":1561121107000},"page":"505-523","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["High-Multiplicity Fair Allocation"],"prefix":"10.1145","author":[{"given":"Robert","family":"Bredereck","sequence":"first","affiliation":[{"name":"TU Berlin, Berlin, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrzej","family":"Kaczmarczyk","sequence":"additional","affiliation":[{"name":"TU Berlin, Berlin, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Du\u0161an","family":"Knop","sequence":"additional","affiliation":[{"name":"TU Berlin, Berlin, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rolf","family":"Niedermeier","sequence":"additional","affiliation":[{"name":"TU Berlin, Berlin, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,6,17]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-00111-7_6"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/3304415.3304423"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219166.3219176"},{"key":"e_1_3_2_2_4_1","volume-title":"Proceedings of the 25th International Joint Conference on Artificial Intelligence (IJCAI '16)","author":"Bliem Berhard","year":"2016","unstructured":"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. 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."},{"volume-title":"Handbook of Computational Social Choice","author":"Bouveret Sylvain","key":"e_1_3_2_2_5_1","unstructured":"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. 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."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/1622673.1622686"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/3237383.3237430"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1086\/664613"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2940716.2940726"},{"key":"e_1_3_2_2_10_1","volume-title":"Marcin Pilipczuk, Micha\u0142 Pilipczuk, and Saket Saurabh.","author":"Cygan Marek","year":"2015","unstructured":"Marek Cygan , Fedor V. Fomin , \u0141ukasz Kowalik , Daniel Lokshtanov , D\u00e1 niel Marx , Marcin Pilipczuk, Micha\u0142 Pilipczuk, and Saket Saurabh. 2015 . Parameterized Algorithms .Springer. Marek Cygan, Fedor V. Fomin, \u0141ukasz Kowalik, Daniel Lokshtanov, D\u00e1 niel Marx, Marcin Pilipczuk, Micha\u0142 Pilipczuk, and Saket Saurabh. 2015. Parameterized Algorithms .Springer."},{"key":"e_1_3_2_2_11_1","volume-title":"Fellows","author":"Downey Rodney G.","year":"2012","unstructured":"Rodney G. Downey and Michael R . Fellows . 2012 . Parameterized Complexity .Springer Publishing Company , Incorporated. Rodney G. Downey and Michael R. Fellows. 2012. Parameterized Complexity .Springer Publishing Company, Incorporated."},{"key":"e_1_3_2_2_12_1","volume-title":"An Algorithmic Theory of Integer Programming. CoRR","author":"Eisenbrand Friedrich","year":"2019","unstructured":"Friedrich Eisenbrand , Christoph Hunkenschr\u00f6 der, Kim-Manuel Klein , Martin Kouteck\u00fd , 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.01361 Friedrich Eisenbrand, Christoph Hunkenschr\u00f6 der, Kim-Manuel Klein, Martin Kouteck\u00fd, 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.01361"},{"key":"e_1_3_2_2_13_1","volume-title":"Proceedings of the 45th International Colloquium on Automata, Languages, and Programming (ICALP '18)","volume":"107","author":"Eisenbrand Friedrich","year":"2018","unstructured":"Friedrich Eisenbrand , Christoph Hunkenschr\u00f6der , 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. Friedrich Eisenbrand, Christoph Hunkenschr\u00f6der, 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."},{"volume-title":"Parameterized Complexity Theory","author":"Flum J\u00f6","key":"e_1_3_2_2_14_1","unstructured":"J\u00f6 rg Flum and Martin Grohe . 2006. Parameterized Complexity Theory . Springer . J\u00f6 rg Flum and Martin Grohe. 2006. Parameterized Complexity Theory .Springer."},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579200"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13036-6_17"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-011-0490-y"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/2875343.2875346"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04428-1_9"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-017-0550-0"},{"key":"e_1_3_2_2_21_1","volume-title":"Proceedings of the 25th Annual European Symposium on Algorithms (ESA '17)","volume":"87","author":"Knop Duvs","year":"2017","unstructured":"Duvs an Knop , Martin Kouteck\u00fd , and Matthias Mnich . 2017 a. 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. Duvs an Knop, Martin Kouteck\u00fd, 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."},{"key":"e_1_3_2_2_22_1","volume-title":"Proceedings of the 34th International Symposium on Theoretical Aspects of Computer Science (STACS '17)","author":"Knop Duvs","year":"2017","unstructured":"Duvs an Knop , Martin Kouteck\u00fd , and Matthias Mnich . 2017 b. 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. Duvs an Knop, Martin Kouteck\u00fd, 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."},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/3237383.3237427"},{"key":"e_1_3_2_2_24_1","volume-title":"Tight Complexity Lower Bounds for Integer Linear Programming with Few Constraints. In 36th International Symposium on Theoretical Aspects of Computer Science (STACS","volume":"126","author":"Knop Duvs","year":"2019","unstructured":"Duvs an Knop , Micha\u0142 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. Duvs an Knop, Micha\u0142 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."},{"key":"e_1_3_2_2_25_1","volume-title":"Proceedings of the 45th International Colloquium on Automata, Languages, and Programming (ICALP '18)","author":"Kouteck\u00fd Martin","year":"2018","unstructured":"Martin Kouteck\u00fd , 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. Martin Kouteck\u00fd, 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."},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.8.4.538"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/988772.988792"},{"volume-title":"Algebraic and Geometric Ideas in the Theory of Discrete Optimization. MOS-SIAM Series on Optimization","author":"De Loera Jes\u00fa","key":"e_1_3_2_2_28_1","unstructured":"Jes\u00fa s A. De Loera , Raymond Hemmecke , and Matthias K\u00f6 ppe. 2013. Algebraic and Geometric Ideas in the Theory of Discrete Optimization. MOS-SIAM Series on Optimization , Vol. 14 . SIAM . Jes\u00fa s A. De Loera, Raymond Hemmecke, and Matthias K\u00f6 ppe. 2013. Algebraic and Geometric Ideas in the Theory of Discrete Optimization. MOS-SIAM Series on Optimization, Vol. 14. SIAM ."},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-014-0830-9"},{"volume-title":"Algorithms and Combinatorics","author":"Patrice Jaroslav Nevs","key":"e_1_3_2_2_30_1","unstructured":"Jaroslav Nevs etvr il and Patrice Ossona de Mendez . 2012. Sparsity - Graphs , Structures, and Algorithms. Algorithms and Combinatorics , Vol. 28 . Springer . Jaroslav Nevs etvr il and Patrice Ossona de Mendez. 2012. Sparsity - Graphs, Structures, and Algorithms. Algorithms and Combinatorics, Vol. 28. Springer."},{"volume-title":"Invitation to Fixed-Parameter Algorithms","author":"Niedermeier Rolf","key":"e_1_3_2_2_31_1","unstructured":"Rolf Niedermeier . 2006. Invitation to Fixed-Parameter Algorithms . Oxford University Press . Rolf Niedermeier. 2006. Invitation to Fixed-Parameter Algorithms .Oxford University Press."},{"key":"e_1_3_2_2_32_1","volume-title":"Nonlinear discrete optimization. Zurich Lectures in Advanced Mathematics","author":"Onn Shmuel","year":"2010","unstructured":"Shmuel Onn . 2010. Nonlinear discrete optimization. Zurich Lectures in Advanced Mathematics , European Mathematical Society ( 2010 ). Shmuel Onn. 2010. Nonlinear discrete optimization. Zurich Lectures in Advanced Mathematics, European Mathematical Society (2010)."},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/322276.322287"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.5555\/3174304.3175470"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2600057.2602835"},{"volume-title":"Theory of Linear and Integer Programming","author":"Schrijver Alexander","key":"e_1_3_2_2_36_1","unstructured":"Alexander Schrijver . 1986. Theory of Linear and Integer Programming . John Wiley & Sons, Inc. , New York, NY, USA . Alexander Schrijver. 1986. Theory of Linear and Integer Programming .John Wiley & Sons, Inc., New York, NY, USA."}],"event":{"name":"EC '19: ACM Conference on Economics and Computation","sponsor":["SIGecom Special Interest Group on Economics and Computation"],"location":"Phoenix AZ USA","acronym":"EC '19"},"container-title":["Proceedings of the 2019 ACM Conference on Economics and Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3328526.3329649","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3328526.3329649","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:54:01Z","timestamp":1750204441000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3328526.3329649"}},"subtitle":["Lenstra Empowered by N-fold Integer Programming"],"short-title":[],"issued":{"date-parts":[[2019,6,17]]},"references-count":36,"alternative-id":["10.1145\/3328526.3329649","10.1145\/3328526"],"URL":"https:\/\/doi.org\/10.1145\/3328526.3329649","relation":{},"subject":[],"published":{"date-parts":[[2019,6,17]]},"assertion":[{"value":"2019-06-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}