{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,9]],"date-time":"2025-12-09T15:38:00Z","timestamp":1765294680334},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2014,10,2]],"date-time":"2014-10-02T00:00:00Z","timestamp":1412208000000},"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":["Auton Agent Multi-Agent Syst"],"published-print":{"date-parts":[[2015,11]]},"DOI":"10.1007\/s10458-014-9277-x","type":"journal-article","created":{"date-parts":[[2014,10,1]],"date-time":"2014-10-01T09:21:51Z","timestamp":1412155311000},"page":"1091-1124","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["Complexity of manipulation, bribery, and campaign management in Bucklin and fallback voting"],"prefix":"10.1007","volume":"29","author":[{"given":"Piotr","family":"Faliszewski","sequence":"first","affiliation":[]},{"given":"Yannick","family":"Reisch","sequence":"additional","affiliation":[]},{"given":"J\u00f6rg","family":"Rothe","sequence":"additional","affiliation":[]},{"given":"Lena","family":"Schend","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,10,2]]},"reference":[{"key":"9277_CR1","doi-asserted-by":"crossref","unstructured":"Bartholdi III, J., & Orlin, J. (1991). Single transferable vote resists strategic voting. Social Choice and Welfare, 8(4), 341\u2013354.","DOI":"10.1007\/BF00183045"},{"key":"9277_CR2","doi-asserted-by":"crossref","unstructured":"Bartholdi III, J., 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":"9277_CR3","doi-asserted-by":"crossref","unstructured":"Bartholdi III, J., Tovey, C., & Trick, M. (1992). How hard is it to control an election? Mathematical and Computer Modelling, 16(8\/9), 27\u201340.","DOI":"10.1016\/0895-7177(92)90085-Y"},{"key":"9277_CR4","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/978-3-642-02839-7_10","volume-title":"Handbook on approval voting, chap. 10","author":"D Baumeister","year":"2010","unstructured":"Baumeister, D., Erd\u00e9lyi, G., Hemaspaandra, E., Hemaspaandra, L., & Rothe, J. (2010). Computational aspects of approval voting. In J. Laslier & R. Sanver (Eds.), Handbook on approval voting, chap. 10 (pp. 199\u2013251). Berlin: Springer."},{"key":"9277_CR5","unstructured":"Baumeister, D., Faliszewski, P., Lang, J., & Rothe, J. (2102). Campaigns for lazy voters: Truncated ballots. Proceedings of the 11th International Joint Conference on Autonomous Agents and Multiagent Systems, IFAAMAS (pp. 577\u2013584)."},{"key":"9277_CR6","unstructured":"Betzler, N., Niedermeier, R., & Woeginger, G. (2011). Unweighted coalitional manipulation under the Borda rule is NP-hard. Proceedings of the 22nd International Joint Conference on Artificial Intelligence (pp. 55\u201360)."},{"issue":"3","key":"9277_CR7","doi-asserted-by":"crossref","first-page":"831","DOI":"10.2307\/1955105","volume":"72","author":"S Brams","year":"1978","unstructured":"Brams, S., & Fishburn, P. (1978). Approval voting. American Political Science Review, 72(3), 831\u2013847.","journal-title":"American Political Science Review"},{"key":"9277_CR8","volume-title":"Approval voting","author":"S Brams","year":"1983","unstructured":"Brams, S., & Fishburn, P. (1983). Approval voting. Boston: Birkh\u00e4user."},{"issue":"2","key":"9277_CR9","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/j.electstud.2005.05.007","volume":"25","author":"S Brams","year":"2006","unstructured":"Brams, S., & Sanver, R. (2006). Critical strategies under approval voting: Who gets ruled in and ruled out. Electoral Studies, 25(2), 287\u2013305.","journal-title":"Electoral Studies"},{"key":"9277_CR10","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/978-3-540-79128-7_12","volume-title":"The mathematics of preference, choice, and order: Essays in honor of Peter C. Fishburn","author":"S Brams","year":"2009","unstructured":"Brams, S., & Sanver, R. (2009). Voting systems that combine approval and preference. In S. Brams, W. Gehrlein, & F. Roberts (Eds.), The mathematics of preference, choice, and order: Essays in honor of Peter C. Fishburn (pp. 215\u2013237). Berlin: Springer."},{"key":"9277_CR11","first-page":"213","volume-title":"Multiagent systems","author":"F Brandt","year":"2013","unstructured":"Brandt, F., Conitzer, V., & Endriss, U. (2013). Computational social choice. In G. Wei\u00df (Ed.), Multiagent systems (2nd ed., pp. 213\u2013283). Cambridge, MA: MIT Press.","edition":"2"},{"key":"9277_CR12","doi-asserted-by":"crossref","unstructured":"Bredereck, R., Chen, J., Faliszewski, P., Nichterlein, A., & Niedermeier, R. (2014). Prices matter for the parameterized complexity of shift bribery. Proceedings of the 28th AAAI Conference on Artificial Intelligence (pp. 1398\u20131404). AAAI Press.","DOI":"10.1609\/aaai.v28i1.8881"},{"key":"9277_CR13","unstructured":"Brelsford, E., Faliszewski, P., Hemaspaandra, E., Schnoor, H., & Schnoor, I. (2008). Approximability of manipulating elections. In: Proceedings of the 23rd AAAI Conference on Artificial Intelligence (pp. 44\u201349). AAAI Press."},{"issue":"3","key":"9277_CR14","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1145\/1236457.1236461","volume":"54","author":"V Conitzer","year":"2007","unstructured":"Conitzer, V., Sandholm, T., & Lang, J. (2007). When are elections with few candidates hard to manipulate? Journal of the ACM, 54(3), 14.","journal-title":"Journal of the ACM"},{"key":"9277_CR15","volume-title":"Handbook of computational social choice","author":"V Conitzer","year":"2014","unstructured":"Conitzer, V., & Walsh, T. (2014). Barriers to manipulation. In F. Brandt, V. Conitzer, U. Endriss, J. Lang, & A. Procaccia (Eds.), Handbook of computational social choice. Cambridge: Cambridge University Press."},{"key":"9277_CR16","doi-asserted-by":"crossref","unstructured":"Davies, J., Katsirelos, G., Narodytska, N., & Walsh, T. (2011). Complexity of and algorithms for Borda manipulation. Proceedings of the 25th AAAI Conference on Artificial Intelligence (pp. 657\u2013662).","DOI":"10.1609\/aaai.v25i1.7873"},{"issue":"1","key":"9277_CR17","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1007\/s00453-011-9568-4","volume":"64","author":"B Dorn","year":"2012","unstructured":"Dorn, B., & Schlotter, I. (2012). Multivariate complexity analysis of swap bribery. Algorithmica, 64(1), 126\u2013151.","journal-title":"Algorithmica"},{"issue":"1","key":"9277_CR18","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/PL00007177","volume":"17","author":"J Duggan","year":"2000","unstructured":"Duggan, J., & Schwartz, T. (2000). Strategic manipulability without resoluteness or shared beliefs: Gibbard\u2013Satterthwaite generalized. Social Choice and Welfare, 17(1), 85\u201393.","journal-title":"Social Choice and Welfare"},{"issue":"4","key":"9277_CR19","doi-asserted-by":"crossref","first-page":"1013","DOI":"10.1111\/1468-0262.00228","volume":"69","author":"B Dutta","year":"2001","unstructured":"Dutta, B., Jackson, M., & Le Breton, M. (2001). Strategic candidacy and voting procedures. Econometrica, 69(4), 1013\u20131037.","journal-title":"Econometrica"},{"key":"9277_CR20","doi-asserted-by":"crossref","unstructured":"Elkind, E., & Faliszewski, P. (2010). Approximation algorithms for campaign management. Proceedings of the 6th International Workshop on Internet and Network Economics (pp. 473\u2013482). Springer, Lecture Notes in Computer Science #6484.","DOI":"10.1007\/978-3-642-17572-5_40"},{"key":"9277_CR21","doi-asserted-by":"crossref","unstructured":"Elkind, E., Faliszewski, P., & Slinko, A. (2009). Swap bribery. Proceedings of the 2nd International Symposium on Algorithmic Game Theory (pp. 299\u2013310). Springer, Lecture Notes in Computer Science #5814","DOI":"10.1007\/978-3-642-04645-2_27"},{"key":"9277_CR22","unstructured":"Erd\u00e9lyi, G., & Fellows, M. (2010). Parameterized control complexity in Bucklin voting and in fallback voting. In V. Conitzer & J. Rothe (Eds.), Proceedings of the 3rd International Workshop on Computational Social Choice (pp. 163\u2013174). Universit\u00e4t D\u00fcsseldorf."},{"key":"9277_CR23","unstructured":"Erd\u00e9lyi, G., Fellows, M., Rothe, J., & Schend, L. (2012). Control complexity in Bucklin and fallback voting. Technical Report arXiv:1103.2230 [cs.CC], Computing Research Repository, arXiv:org\/corr\/ (2012). March, 2011. Revised August, 2012. An extended version merging the CATS-2010, COMSOC-2010, AAMAS-2011, and SEA-2012 papers [26,22,25,44] has been accepted for publication in Journal of Computer and System Sciences."},{"issue":"4","key":"9277_CR24","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1002\/malq.200810020","volume":"55","author":"G Erd\u00e9lyi","year":"2009","unstructured":"Erd\u00e9lyi, G., Nowak, M., & Rothe, J. (2009). Sincere-strategy preference-based approval voting fully resists constructive control and broadly resists destructive control. Mathematical Logic Quarterly, 55(4), 425\u2013443.","journal-title":"Mathematical Logic Quarterly"},{"key":"9277_CR25","unstructured":"Erd\u00e9lyi, G., Piras, L., & Rothe, J. (2011). The complexity of voter partition in Bucklin and fallback voting: Solving three open problems. Proceedings of the 10th International Joint Conference on Autonomous Agents and Multiagent Systems. IFAAMAS (pp. 837\u2013844)."},{"key":"9277_CR26","unstructured":"Erd\u00e9lyi, G., & Rothe, J. (2010). Control complexity in fallback voting. Proceedings of Computing: the 16th Australasian Theory Symposium (pp. 39\u201348). Australian Computer Society Conferences in Research and Practice in Information Technology Series, vol. 32, no. 8."},{"key":"9277_CR27","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. (2009). How hard is bribery in elections? Journal of Artificial Intelligence Research, 35, 485\u2013532.","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"11","key":"9277_CR28","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1145\/1839676.1839696","volume":"53","author":"P Faliszewski","year":"2010","unstructured":"Faliszewski, P., Hemaspaandra, E., & Hemaspaandra, L. (2010). Using complexity to protect elections. Communications of the ACM, 53(11), 74\u201382.","journal-title":"Communications of the ACM"},{"key":"9277_CR29","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. (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"},{"key":"9277_CR30","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1007\/978-1-4020-9688-4_14","volume-title":"Fundamental problems in computing: Essays in honor of professor Daniel J. Rosenkrantz, chap. 14","author":"P Faliszewski","year":"2009","unstructured":"Faliszewski, P., Hemaspaandra, E., Hemaspaandra, L., & Rothe, J. (2009). A richer understanding of the complexity of election systems. In S. Ravi & S. Shukla (Eds.), Fundamental problems in computing: Essays in honor of professor Daniel J. Rosenkrantz, chap. 14 (pp. 375\u2013406). Dordrecht: Springer."},{"key":"9277_CR31","unstructured":"Faliszewski, P., Hemaspaandra, E., & Schnoor, H. (2010). Manipulation of Copeland elections. Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems (pp. 367\u2013374). International Foundation for Autonomous Agents and Multiagent Systems."},{"issue":"4","key":"9277_CR32","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1609\/aimag.v31i4.2314","volume":"31","author":"P Faliszewski","year":"2010","unstructured":"Faliszewski, P., & Procaccia, A. (2010). AI\u2019s war on manipulation: Are we winning? AI Magazine, 31(4), 53\u201364.","journal-title":"AI Magazine"},{"key":"9277_CR33","volume-title":"Handbook of computational social choice","author":"P Faliszewski","year":"2014","unstructured":"Faliszewski, P., & Rothe, J. (2014). Control and bribery. In F. Brandt, V. Conitzer, U. Endriss, J. Lang, & A. Procaccia (Eds.), Handbook of computational social choice. Cambridge: Cambridge University Press."},{"key":"9277_CR34","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. New York: W. H. Freeman and Company."},{"issue":"4","key":"9277_CR35","doi-asserted-by":"crossref","first-page":"587","DOI":"10.2307\/1914083","volume":"41","author":"A Gibbard","year":"1973","unstructured":"Gibbard, A. (1973). Manipulation of voting schemes. Econometrica, 41(4), 587\u2013601.","journal-title":"Econometrica"},{"issue":"5\u20136","key":"9277_CR36","doi-asserted-by":"crossref","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. (2007). Anyone but him: The complexity of precluding an alternative. Artificial Intelligence, 171(5\u20136), 255\u2013285.","journal-title":"Artificial Intelligence"},{"key":"9277_CR37","unstructured":"Konczak, K., & Lang, J. (2005). Voting procedures with incomplete preferences. Proceedings of the Multidisciplinary IJCAI-05 Workshop on Advances in Preference Handling (pp. 124\u2013129)."},{"key":"9277_CR38","unstructured":"Lin, A. (2012). Solving hard problems in election systems. Ph.D. thesis, Rochester Institute of Technology, Rochester, NY."},{"issue":"4","key":"9277_CR39","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1007\/s00224-012-9441-0","volume":"53","author":"C Menton","year":"2013","unstructured":"Menton, C. (2013). Normalized range voting broadly resists control. Theory of Computing Systems, 53(4), 507\u2013531.","journal-title":"Theory of Computing Systems"},{"key":"9277_CR40","unstructured":"Menton, C., & Singh, P. (2013). Control complexity of Schulze voting. Proceedings of the 23rd International Joint Conference on Artificial Intelligence (pp. 286\u2013292). AAAI Press\/IJCAI."},{"key":"9277_CR41","volume-title":"Computational complexity","author":"C Papadimitriou","year":"1995","unstructured":"Papadimitriou, C. (1995). Computational complexity (2nd ed.). Reading, MA: Addison-Wesley.","edition":"2"},{"key":"9277_CR42","unstructured":"Parkes, D., & Xia, L. (2012). A complexity-of-strategic-behavior comparison between Schulze\u2019s rule and ranked pairs. Proceedings of the 26th AAAI Conference on Artificial Intelligence (pp. 1429\u20131435). AAAI Press."},{"key":"9277_CR43","volume-title":"Complexity theory and cryptology. An introduction to cryptocomplexity. EATCS texts in theoretical computer science","author":"J Rothe","year":"2005","unstructured":"Rothe, J. (2005). Complexity theory and cryptology. An introduction to cryptocomplexity. EATCS texts in theoretical computer science. Berlin: Springer."},{"key":"9277_CR44","doi-asserted-by":"crossref","unstructured":"Rothe, J., & Schend, L. (2012). Control complexity in Bucklin, fallback, and plurality voting: An experimental approach. Proceedings of the 11th International Symposium on Experimental Algorithms (pp. 356\u2013368). Springer, Lecture Notes in Computer Science #7276.","DOI":"10.1007\/978-3-642-30850-5_31"},{"issue":"1\u20133","key":"9277_CR45","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/s10472-013-9359-5","volume":"68","author":"J Rothe","year":"2013","unstructured":"Rothe, J., & Schend, L. (2013). Challenges to complexity shields that are supposed to protect elections against manipulation and control: A survey. Annals of Mathematics and Artificial Intelligence, 68(1\u20133), 161\u2013193.","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"issue":"2","key":"9277_CR46","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/0022-0531(75)90050-2","volume":"10","author":"M Satterthwaite","year":"1975","unstructured":"Satterthwaite, M. (1975). Strategy-proofness and Arrow\u2019s conditions: Existence and correspondence theorems for voting procedures and social welfare functions. Journal of Economic Theory, 10(2), 187\u2013217.","journal-title":"Journal of Economic Theory"},{"key":"9277_CR47","doi-asserted-by":"crossref","unstructured":"Schlotter, I., Faliszewski, P., & Elkind, E. (2011). Campaign management under approval-driven voting rules. Proceedings of the 25th AAAI Conference on Artificial Intelligence (pp. 726\u2013731).","DOI":"10.1609\/aaai.v25i1.7870"},{"key":"9277_CR48","unstructured":"Walsh, T. (2011). Where are the hard manipulation problems? Journal of Artificial Intelligence Research, 42, 1\u201329."},{"key":"9277_CR49","doi-asserted-by":"crossref","unstructured":"Xia, L. (2012). Computing the margin of victory for various voting rules. Proceedings of the 13th ACM Conference on Electronic Commerce (pp. 982\u2013999). ACM Press.","DOI":"10.1145\/2229012.2229086"},{"key":"9277_CR50","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1613\/jair.3186","volume":"41","author":"L Xia","year":"2011","unstructured":"Xia, L., & Conitzer, V. (2011). Determining possible and necessary winners given partial orders. Journal of Artificial Intelligence Research, 41, 25\u201367.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"9277_CR51","unstructured":"Xia, L., Zuckerman, M., Procaccia, A., Conitzer, V., & Rosenschein, J. (2009). Complexity of unweighted coalitional manipulation under some common voting rules. Proceedings of the 21st International Joint Conference on Artificial Intelligence (pp. 348\u2013353). IJCAI."}],"container-title":["Autonomous Agents and Multi-Agent Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-014-9277-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10458-014-9277-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-014-9277-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,16]],"date-time":"2023-07-16T23:16:25Z","timestamp":1689549385000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10458-014-9277-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,10,2]]},"references-count":51,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2015,11]]}},"alternative-id":["9277"],"URL":"https:\/\/doi.org\/10.1007\/s10458-014-9277-x","relation":{},"ISSN":["1387-2532","1573-7454"],"issn-type":[{"value":"1387-2532","type":"print"},{"value":"1573-7454","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,10,2]]}}}