{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:16:31Z","timestamp":1740122191165,"version":"3.37.3"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T00:00:00Z","timestamp":1556928000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T00:00:00Z","timestamp":1556928000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["Graduate Research Fellowship under grant no. DGE-1102937"],"award-info":[{"award-number":["Graduate Research Fellowship under grant no. DGE-1102937"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Auton Agent Multi-Agent Syst"],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1007\/s10458-019-09410-4","type":"journal-article","created":{"date-parts":[[2019,5,6]],"date-time":"2019-05-06T13:24:22Z","timestamp":1557149062000},"page":"383-402","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["High-multiplicity election problems"],"prefix":"10.1007","volume":"33","author":[{"given":"Zack","family":"Fitzsimmons","sequence":"first","affiliation":[]},{"given":"Edith","family":"Hemaspaandra","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,5,4]]},"reference":[{"key":"9410_CR1","unstructured":"Bachrach, Y., Lev, O., Lewenberg, Y., & Zick, Y. (July 2016). Misrepresentation in district voting. In Proceedings of the 25th international joint conference on artificial intelligence (pp. 81\u201387). IJCAI\/AAAI Press."},{"key":"9410_CR2","doi-asserted-by":"crossref","unstructured":"Bartholdi, J., III., Tovey, C., & Trick, M. (1989). The computational difficulty of manipulating an election. Social Choice and Welfare, 6(3), 227\u2013241.","DOI":"10.1007\/BF00295861"},{"key":"9410_CR3","doi-asserted-by":"crossref","unstructured":"Bartholdi, J., III., Tovey, C., & Trick, M. (1992). How hard is it to control an election? Mathematical and Computer Modeling, 16(8\/9), 27\u201340.","DOI":"10.1016\/0895-7177(92)90085-Y"},{"issue":"8","key":"9410_CR4","doi-asserted-by":"publisher","first-page":"812","DOI":"10.1016\/j.jcss.2010.04.002","volume":"76","author":"N Betzler","year":"2010","unstructured":"Betzler, N., & Dorn, B. (2010). Towards a dichotomy of finding possible winners in elections based on scoring rules. Journal of Computer and System Sciences, 76(8), 812\u2013836.","journal-title":"Journal of Computer and System Sciences"},{"key":"9410_CR5","unstructured":"Betzler, N., Niedermeier, R., & Woeginger, G. (July 2011). Unweighted coalitional manipulation under the Borda rule is NP-hard. In Proceedings of the 22nd international joint conference on artificial intelligence (pp. 55\u201360). IJCAI\/AAAI Press."},{"issue":"2","key":"9410_CR6","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1090\/S0002-9939-1976-0396605-3","volume":"55","author":"I Borosh","year":"1976","unstructured":"Borosh, I., & Treybig, L. (1976). Bounds on positive integral solutions of linear Diophantine equations. Proceedings of the American Mathematical Society, 55(2), 299\u2013304.","journal-title":"Proceedings of the American Mathematical Society"},{"key":"9410_CR7","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107446984","volume-title":"Handbook of Computational Social Choice","author":"F Brandt","year":"2016","unstructured":"Brandt, F., Conitzer, V., Endriss, U., Lang, J., & Procaccia, A. (2016). Handbook of Computational Social Choice. Cambridge: Cambridge University Press."},{"issue":"3","key":"9410_CR8","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/PL00011403","volume":"89","author":"J Clifford","year":"2001","unstructured":"Clifford, J., & Posner, M. (2001). Parallel machine scheduling with high multiplicity. Mathematical Programming, 89(3), 359\u2013383.","journal-title":"Mathematical Programming"},{"key":"9410_CR9","doi-asserted-by":"crossref","unstructured":"Conitzer, V., Sandholm, T., & Lang, J. (2007). When are elections with few candidates hard to manipulate? Journal of the ACM, 54(3), Article\u00a014.","DOI":"10.1145\/1236457.1236461"},{"key":"9410_CR10","doi-asserted-by":"crossref","unstructured":"Davies, J., Katsirelos, G., Narodytska, N., & Walsh, T. (August 2011). Complexity and algorithms for Borda manipulation. In Proceedings of the 25th AAAI conference on artificial intelligence (pp. 657\u2013662). AAAI Press.","DOI":"10.1609\/aaai.v25i1.7873"},{"key":"9410_CR11","doi-asserted-by":"crossref","unstructured":"Dwork, C., Kumar, R., Naor, M., & Sivakumar, D. (March 2001). Rank aggregation methods for the web. In Proceedings of the 10th international world wide web conference (pp. 613\u2013622). ACM Press.","DOI":"10.1145\/371920.372165"},{"key":"9410_CR12","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1613\/jair.2676","volume":"35","author":"P Faliszewski","year":"2009","unstructured":"Faliszewski, P., Hemaspaandra, E., & Hemaspaandra, L. (2009). How hard is bribery in elections? Journal of Artificial Intelligence Research, 35, 485\u2013532.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"9410_CR13","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1613\/jair.4621","volume":"52","author":"P Faliszewski","year":"2015","unstructured":"Faliszewski, P., Hemaspaandra, E., & Hemaspaandra, L. (2015). Weighted electoral control. Journal of Artificial Intelligence Research, 52, 507\u2013542.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"9410_CR14","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1613\/jair.2697","volume":"35","author":"P Faliszewski","year":"2009","unstructured":"Faliszewski, P., Hemaspaandra, E., Hemaspaandra, L., & Rothe, J. (2009). Llull and Copeland voting computationally resist bribery and constructive control. Journal of Artificial Intelligence Research, 35, 275\u2013341.","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"2","key":"9410_CR15","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.ic.2010.09.001","volume":"209","author":"P Faliszewski","year":"2011","unstructured":"Faliszewski, P., Hemaspaandra, E., Hemaspaandra, L., & Rothe, J. (2011). The shield that never was: Societies with single-peaked preferences are more open to manipulation and control. Information and Computation, 209(2), 89\u2013107.","journal-title":"Information and Computation"},{"key":"9410_CR16","doi-asserted-by":"crossref","unstructured":"Fitzsimmons, Z., & Hemaspaandra, E. (February 2017). The complexity of succinct elections. In Proceedings of the 31st AAAI conference on artificial intelligence (Student Abstract) (pp. 4921\u20134922). AAAI Press.","DOI":"10.1609\/aaai.v31i1.11122"},{"key":"9410_CR17","unstructured":"Fitzsimmons, Z., & Hemaspaandra, E. (July 2018). High-multiplicity election problems. In Proceedings of the 17th international conference on autonomous agents and multiagent systems (pp. 1558\u20131566). IFAAMAS."},{"key":"9410_CR18","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M Garey","year":"1979","unstructured":"Garey, M., & Johnson, D. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco: W. H. Freeman and Company."},{"key":"9410_CR19","doi-asserted-by":"crossref","unstructured":"Goemans, M., & Rothvo\u00df, T. (January 2014). Polynomiality for bin packing with a constant number of item types. In Proceedings of the 25th annual ACM-SIAM symposium on discrete algorithms (pp. 830\u2013839). SIAM.","DOI":"10.1137\/1.9781611973402.61"},{"issue":"3","key":"9410_CR20","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/0022-0000(89)90025-1","volume":"39","author":"L Hemachandra","year":"1989","unstructured":"Hemachandra, L. (1989). The strong exponential hierarchy collapses. Journal of Computer and System Sciences, 39(3), 299\u2013322.","journal-title":"Journal of Computer and System Sciences"},{"issue":"1","key":"9410_CR21","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.jcss.2006.09.002","volume":"73","author":"E Hemaspaandra","year":"2007","unstructured":"Hemaspaandra, E., & Hemaspaandra, L. (2007). Dichotomy for voting systems. Journal of Computer and System Sciences, 73(1), 73\u201383.","journal-title":"Journal of Computer and System Sciences"},{"issue":"4","key":"9410_CR22","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1002\/malq.200810019","volume":"55","author":"E Hemaspaandra","year":"2009","unstructured":"Hemaspaandra, E., Hemaspaandra, L., & Rothe, J. (2009). Hybrid elections broaden complexity-theoretic resistance to control. Mathematical Logic Quarterly, 55(4), 397\u2013424.","journal-title":"Mathematical Logic Quarterly"},{"issue":"4","key":"9410_CR23","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1016\/j.jcss.2013.10.001","volume":"80","author":"E Hemaspaandra","year":"2014","unstructured":"Hemaspaandra, E., Hemaspaandra, L., & Rothe, J. (2014). The complexity of online manipulation of sequential elections. Journal of Computer and System Sciences, 80(4), 697\u2013710.","journal-title":"Journal of Computer and System Sciences"},{"key":"9410_CR24","doi-asserted-by":"crossref","unstructured":"Hemaspaandra, E., Hemaspaandra, L., & Schnoor, H. (July 2014). A control dichotomy for pure scoring rules. In Proceedings of the 28th AAAI conference on artificial intelligence (pp. 712\u2013720). AAAI Press.","DOI":"10.1609\/aaai.v28i1.8800"},{"key":"9410_CR25","doi-asserted-by":"crossref","unstructured":"Hemaspaandra, E., Hemaspaandra, L., & Schnoor, H. (April 2014). A control dichotomy for pure scoring rules. Technical Report. arXiv:1404.4560 [cs.GT].","DOI":"10.1609\/aaai.v28i1.8800"},{"key":"9410_CR26","unstructured":"Hemaspaandra, E., & Schnoor, H. (April 2016). Complexity dichotomies for unweighted scoring rules. Technical Report. arXiv:1604.05264 [cs.CC]."},{"key":"9410_CR27","unstructured":"Hemaspaandra, E., & Schnoor, H. (August\/September 2016). Dichotomy for pure scoring rules under manipulative electoral actions. In Proceedings of the 22nd European conference on artificial intelligence (pp. 1071\u20131079). IOS Press."},{"issue":"3","key":"9410_CR28","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1016\/j.tcs.2005.08.031","volume":"349","author":"E Hemaspaandra","year":"2005","unstructured":"Hemaspaandra, E., Spakowski, H., & Vogel, J. (2005). The complexity of Kemeny elections. Theoretical Computer Science, 349(3), 382\u2013391.","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"9410_CR29","doi-asserted-by":"publisher","first-page":"648","DOI":"10.1287\/opre.39.4.648","volume":"39","author":"D Hochbaum","year":"1991","unstructured":"Hochbaum, D., & Shamir, R. (1991). Strongly polynomial algorithms for the high multiplicity scheduling problem. Operations Research, 39(4), 648\u2013653.","journal-title":"Operations Research"},{"key":"9410_CR30","doi-asserted-by":"crossref","unstructured":"Karp, R. (March 1972). Reducibilities among combinatorial problems. In Proceedings of a symposium on the complexity of computer computations (pp. 85\u2013103). Plenum Press.","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"9410_CR31","first-page":"577","volume":"88","author":"J Kemeny","year":"1959","unstructured":"Kemeny, J. (1959). Mathematics without numbers. Daedalus, 88, 577\u2013591.","journal-title":"Daedalus"},{"key":"9410_CR32","doi-asserted-by":"crossref","unstructured":"Lenstra, H., Jr. (1983). Integer programming with a fixed number of variables. Mathematics of Operations Research, 8(4), 538\u2013548.","DOI":"10.1287\/moor.8.4.538"},{"issue":"1","key":"9410_CR33","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1287\/opre.30.1.163","volume":"30","author":"J Leung","year":"1982","unstructured":"Leung, J. (1982). On scheduling independent tasks with restricted execution times. Operations Research, 30(1), 163\u2013171.","journal-title":"Operations Research"},{"key":"9410_CR34","unstructured":"Lin, A. (2012). Solving hard problems in election systems. PhD thesis, Rochester Institute of Technology, Rochester, NY."},{"key":"9410_CR35","doi-asserted-by":"crossref","unstructured":"Mattei, N., & Walsh, T. (November 2013). PrefLib: A library for preferences. In Proceedings of the 3rd international conference on algorithmic decision theory (pp. 259\u2013270). Springer.","DOI":"10.1007\/978-3-642-41575-3_20"},{"issue":"1","key":"9410_CR36","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1287\/moor.26.1.31.10590","volume":"26","author":"T McCormick","year":"2001","unstructured":"McCormick, T., Smallwood, S., & Spieksma, F. (2001). A polynomial algorithm for multiprocessor scheduling with two job lengths. Mathematics of Operations Research, 26(1), 31\u201349.","journal-title":"Mathematics of Operations Research"},{"issue":"4","key":"9410_CR37","doi-asserted-by":"publisher","first-page":"608","DOI":"10.2307\/1907926","volume":"21","author":"D McGarvey","year":"1953","unstructured":"McGarvey, D. (1953). A theorem on the construction of voting paradoxes. Econometrica, 21(4), 608\u2013610.","journal-title":"Econometrica"},{"key":"9410_CR38","unstructured":"Russell, N. (2007). Complexity of control of Borda count elections. Master\u2019s thesis, Rochester Institute of Technology."},{"key":"9410_CR39","volume-title":"Combinatorial optimization: Polyhedra and efficiency","author":"A Schrijver","year":"2003","unstructured":"Schrijver, A. (2003). Combinatorial optimization: Polyhedra and efficiency. Berlin: Springer."},{"key":"9410_CR40","doi-asserted-by":"crossref","unstructured":"Xia, L., Conitzer, V., & Procaccia, A. (June 2010). A scheduling approach to coalitional manipulation. In Proceedings of the 11th ACM conference on electronic commerce (pp. 275\u2013284). ACM Press.","DOI":"10.1145\/1807342.1807386"},{"issue":"2","key":"9410_CR41","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1137\/0135023","volume":"35","author":"H Young","year":"1978","unstructured":"Young, H., & Levenglick, A. (1978). A consistent extension of Condorcet\u2019s election principle. SIAM Journal on Applied Mathematics, 35(2), 285\u2013300.","journal-title":"SIAM Journal on Applied Mathematics"}],"container-title":["Autonomous Agents and Multi-Agent Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-019-09410-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10458-019-09410-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-019-09410-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,17]],"date-time":"2022-09-17T11:00:43Z","timestamp":1663412443000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10458-019-09410-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5,4]]},"references-count":41,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,7]]}},"alternative-id":["9410"],"URL":"https:\/\/doi.org\/10.1007\/s10458-019-09410-4","relation":{},"ISSN":["1387-2532","1573-7454"],"issn-type":[{"type":"print","value":"1387-2532"},{"type":"electronic","value":"1573-7454"}],"subject":[],"published":{"date-parts":[[2019,5,4]]},"assertion":[{"value":"4 May 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}