{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,3]],"date-time":"2026-08-03T21:49:58Z","timestamp":1785793798108,"version":"3.56.0"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[2015,11,3]],"date-time":"2015-11-03T00:00:00Z","timestamp":1446508800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Math Artif Intell"],"published-print":{"date-parts":[[2016,8]]},"DOI":"10.1007\/s10472-015-9479-1","type":"journal-article","created":{"date-parts":[[2015,11,3]],"date-time":"2015-11-03T02:10:27Z","timestamp":1446516627000},"page":"191-223","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Schulze and ranked-pairs voting are fixed-parameter tractable to bribe, manipulate, and control"],"prefix":"10.1007","volume":"77","author":[{"given":"Lane A.","family":"Hemaspaandra","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rahman","family":"Lavaee","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Curtis","family":"Menton","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2015,11,3]]},"reference":[{"issue":"3","key":"9479_CR1","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/BF00295861","volume":"6","author":"J Bartholdi III","year":"1989","unstructured":"Bartholdi III, J., Tovey, C., Trick, M.: The computational difficulty of manipulating an election. Soc. Choice Welf. 6(3), 227\u2013241 (1989)","journal-title":"Soc. Choice Welf."},{"issue":"8\/9","key":"9479_CR2","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0895-7177(92)90085-Y","volume":"16","author":"J Bartholdi III","year":"1992","unstructured":"Bartholdi III, J., Tovey, C., Trick, M.: How hard is it to control an election? Math. Comput. Model. 16(8\/9), 27\u201340 (1992)","journal-title":"Math. Comput. Model."},{"key":"9479_CR3","unstructured":"Betzler, N.: A multivariate complexity analysis of voting problems. Ph.D. thesis, Friedrich-Schiller-Universit\u00e4t Jena, Jena, Germany (2010)"},{"key":"9479_CR4","doi-asserted-by":"crossref","unstructured":"Betzler, N., Bredereck, R., Chen, J., Niedermeier, R.: Studies in computational aspects of voting\u2014A parameterized complexity perspective. In: The Multivariate Algorithmic Revolution and Beyond, 318\u2013363. Springer-Verlag Lecture Notes in Computer Science #7370 (2012)","DOI":"10.1007\/978-3-642-30891-8_16"},{"issue":"52","key":"9479_CR5","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.tcs.2009.05.029","volume":"410","author":"N Betzler","year":"2009","unstructured":"Betzler, N., Uhlmann, J.: Parameterized complexity of candidate control in elections and related digraph problems. Theor. Comput. Sci. 410(52), 43\u201353 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"9479_CR6","doi-asserted-by":"crossref","unstructured":"Brill, M., Fischer, F.: The price of neutrality for the ranked pairs method. In: Proceedings of the 26th AAAI Conference on Artificial Intelligence, pp. 1299\u20131305. AAAI Press (2012)","DOI":"10.1609\/aaai.v26i1.8250"},{"key":"9479_CR7","doi-asserted-by":"publisher","unstructured":"Conitzer, V., Sandholm, T., Lang, J.: When are elections with few candidates hard to manipulate? J. ACM 54(3) (2007). Article 14","DOI":"10.1145\/1236457.1236461"},{"issue":"1","key":"9479_CR8","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/s00453-011-9568-4","volume":"64","author":"B Dorn","year":"2012","unstructured":"Dorn, B., Schlotter, I.: Multivariate complexity analysis of swap bribery. Algorithmica 64(1), 126\u2013151 (2012)","journal-title":"Algorithmica"},{"key":"9479_CR9","doi-asserted-by":"publisher","unstructured":"Downey, R., Fellows, M.: Parameterized Complexity. Springer-Verlag (1999)","DOI":"10.1007\/978-1-4612-0515-9"},{"key":"9479_CR10","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1613\/jair.2676","volume":"35","author":"P Faliszewski","year":"2009","unstructured":"Faliszewski, P., Hemaspaandra, E., Hemaspaandra, L.: How hard is bribery in elections? J. Artif. Intell. Res. 35, 485\u2013532 (2009)","journal-title":"J. Artif. Intell. Res."},{"key":"9479_CR11","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1613\/jair.3136","volume":"40","author":"P Faliszewski","year":"2011","unstructured":"Faliszewski, P., Hemaspaandra, E., Hemaspaandra, L.: Multimode control attacks on elections. J. Artif. Intell. Res. 40, 305\u2013351 (2011)","journal-title":"J. Artif. Intell. Res."},{"key":"9479_CR12","unstructured":"Faliszewski, P., Hemaspaandra, E., Hemaspaandra, L.: Weighted electoral control. In: Proceedings of the 12th International Conference on Autonomous Agents and Multiagent Systems, 367\u2013374. International Foundation for Autonomous Agents and Multiagent Systems (2013)"},{"key":"9479_CR13","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/j.artint.2013.11.004","volume":"207","author":"P Faliszewski","year":"2014","unstructured":"Faliszewski, P., Hemaspaandra, E., Hemaspaandra, L.: The complexity of manipulative attacks in nearly single-peaked electorates. Artif. Intell. 207, 69\u201399 (2014)","journal-title":"Artif. Intell."},{"key":"9479_CR14","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1613\/jair.2697","volume":"35","author":"P Faliszewski","year":"2009","unstructured":"Faliszewski, P., Hemaspaandra, E., Hemaspaandra, L., Rothe, J.: Llull and Copeland voting computationally resist bribery and constructive control. J. Artif. Intell. Res. 35, 275\u2013341 (2009)","journal-title":"J. Artif. Intell. Res."},{"key":"9479_CR15","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer-Verlag (2006)"},{"key":"9479_CR16","unstructured":"Gaspers, S., Kalinowski, T., Narodytska, N., Walsh, T.: Coalitional manipulation for Schulze\u2019s rule. In: Proceedings of the 12th International Conference on Autonomous Agents and Multiagent Systems, 431\u2013438. International Foundation for Autonomous Agents and Multiagent Systems (2013)"},{"issue":"1","key":"9479_CR17","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/1233481.1233493","volume":"38","author":"J Guo","year":"2007","unstructured":"Guo, J., Niedermeier, R.: Invitation to data reduction and problem kernelization. SIGACT News 38(1), 31\u201345 (2007)","journal-title":"SIGACT News"},{"key":"9479_CR18","unstructured":"Hemaspaandra, E., Hemaspaandra, L., Menton, C.: Search versus decision for election manipulation problems. In: Proceedings of the 30th Annual Symposium on Theoretical Aspects of Computer Science, 377\u2013388. Leibniz International Proceedings in Informatics (LIPIcs) (2013)"},{"issue":"5\u20136","key":"9479_CR19","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/j.artint.2007.01.005","volume":"171","author":"E Hemaspaandra","year":"2007","unstructured":"Hemaspaandra, E., Hemaspaandra, L., Rothe, J.: Anyone but him: The complexity of precluding an alternative. Artif. Intell. 171(5\u20136), 255\u2013285 (2007)","journal-title":"Artif. Intell."},{"key":"9479_CR20","unstructured":"Hemaspaandra, L., Lavaee, R., Menton, C.: Schulze and ranked-pairs voting are fixed-parameter tractable to bribe, manipulate, and control. Tech. Rep. arXiv: http:\/\/arxiv.org\/abs\/1301.6118 [cs.GT], Computing Res. Rep., http:\/\/arxiv.org\/corr\/ Revised June 2014 (2012)"},{"key":"9479_CR21","unstructured":"Hemaspaandra, L., Lavaee, R., Menton, C.: Schulze and ranked-pairs voting are fixed-parameter tractable to bribe, manipulate, and control. In: Proceedings of the 12th International Conference on Autonomous Agents and Multiagent Systems, 1345\u20131346. International Foundation for Autonomous Agents and Multiagent Systems (2013)"},{"issue":"1","key":"9479_CR22","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/S0168-0072(95)00020-8","volume":"84","author":"L Cai","year":"1997","unstructured":"Cai, L., Chen, J., Downey, R., Fellows, M.: Advice classes of parameterized tractability. Annals of Pure and Applied Logic 84(1), 119\u2013138 (1997)","journal-title":"Annals of Pure and Applied Logic"},{"issue":"4","key":"9479_CR23","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"H Lenstra Jr.","year":"1983","unstructured":"Lenstra Jr., H.: Integer programming with a fixed number of variables. Math. Oper. Res. 8(4), 538\u2013548 (1983)","journal-title":"Math. Oper. Res."},{"key":"9479_CR24","unstructured":"Lin, A.: Solving hard problems in election systems. Ph.D. thesis, Rochester Institute of Technology, Rochester, NY (2012)"},{"issue":"10","key":"9479_CR25","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/j.ipl.2010.03.006","volume":"110","author":"H Liu","year":"2010","unstructured":"Liu, H., Zhu, D.: Parameterized complexity of control problems in maximin election. Inf. Process. Lett. 110(10), 383\u2013388 (2010)","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"9479_CR26","doi-asserted-by":"publisher","first-page":"608","DOI":"10.2307\/1907926","volume":"21","author":"D McGarvey","year":"1953","unstructured":"McGarvey, D.: A theorem on the construction of voting paradoxes. Econometrica 21(4), 608\u2013610 (1953)","journal-title":"Econometrica"},{"key":"9479_CR27","unstructured":"Menton, C., Singh, P.: Manipulation and control complexity of Schulze voting. Tech. Rep. arXiv: http:\/\/arxiv.org\/abs\/1206.2111v1 (version 1) [cs.GT], Computing Research Repository, http:\/\/arxiv.org\/corr\/ (2012)"},{"key":"9479_CR28","unstructured":"Menton, C., Singh, P.: Control complexity of Schulze voting. In: Proceedings of the 23rd International Joint Conference on Artificial Intelligence, 286\u2013292. AAAI Press (2013)"},{"key":"9479_CR29","unstructured":"Menton, C., Singh, P.: Manipulation and control complexity of Schulze voting. Tech. Rep. arXiv: http:\/\/arxiv.org\/abs\/1206.2111 (version 4) [cs.GT], Computing Research Repository, http:\/\/arxiv.org\/corr\/ (2013)"},{"key":"9479_CR30","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to Fixed-Parameter Algorithms","author":"R Niedermeier","year":"2006","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press, London (2006)"},{"key":"9479_CR31","unstructured":"Parkes, D., Xia, L.: A complexity-of-strategic-behavior comparison between Schulze\u2019s rule and ranked pairs. In: Proceedings of the 26th AAAI Conference on Artificial Intelligence, 1429\u20131435. AAAI Press (2012)"},{"issue":"1\u20133","key":"9479_CR32","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s10472-013-9359-5","volume":"68","author":"J Rothe","year":"2013","unstructured":"Rothe, J., Schend, L.: Challenges to complexity shields that are supposed to protect elections against manipulation and control: A survey. Ann. Math. Artif. Intell. 68(1\u20133), 161\u2013193 (2013)","journal-title":"Ann. Math. Artif. Intell."},{"key":"9479_CR33","unstructured":"Russell, N.: Complexity of control of Borda count elections. Master\u2019s thesis, Rochester Institute of Technology (2007)"},{"key":"9479_CR34","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/s00355-010-0475-4","volume":"36","author":"M Schulze","year":"2011","unstructured":"Schulze, M.: A new monotonic, clone-independent, reversal symmetric, and Condorcet-consistent single-winner election method. Soc. Choice Welf. 36, 267\u2013303 (2011)","journal-title":"Soc. Choice Welf."},{"key":"9479_CR35","unstructured":"Tideman, T.: Collective Decisions and Voting: The Potential for Public Choice. Ashgate Publishing (2006)"},{"key":"9479_CR36","unstructured":"Wikipedia: Schulze method en.wikipedia.org\/wiki\/Schulze_method (2013)"},{"key":"9479_CR37","doi-asserted-by":"publisher","unstructured":"Xia, L.: Computing the margin of victory for various voting rules. In: Proceedings of the 13th ACM Conference on Electronic Commerce, 982\u2013999 (2012)","DOI":"10.1145\/2229012.2229086"},{"key":"9479_CR38","unstructured":"Xia, L., Zuckerman, M., Procaccia, A., Conitzer, V., Rosenschein, J.: Complexity of unweighted manipulation under some common voting rules. In: Proceedings of the 21st International Joint Conference on Artificial Intelligence, 348\u2013353 (2009)"}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-015-9479-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10472-015-9479-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-015-9479-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,15]],"date-time":"2023-08-15T18:29:27Z","timestamp":1692124167000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10472-015-9479-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,11,3]]},"references-count":38,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2016,8]]}},"alternative-id":["9479"],"URL":"https:\/\/doi.org\/10.1007\/s10472-015-9479-1","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"value":"1012-2443","type":"print"},{"value":"1573-7470","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,11,3]]}}}