{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T18:10:31Z","timestamp":1774635031094,"version":"3.50.1"},"reference-count":63,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,7,29]],"date-time":"2021-07-29T00:00:00Z","timestamp":1627516800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,7,29]],"date-time":"2021-07-29T00:00:00Z","timestamp":1627516800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["RO-1202\/14-2"],"award-info":[{"award-number":["RO-1202\/14-2"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["RO-1202\/21-1"],"award-info":[{"award-number":["RO-1202\/21-1"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005690","name":"Universit\u00e4t des Saarlandes","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100005690","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Auton Agent Multi-Agent Syst"],"published-print":{"date-parts":[[2021,10]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We investigate the computational complexity of electoral control in elections. Electoral control describes the scenario where the election chair seeks to alter the outcome of the election by structural changes such as adding, deleting, or replacing either candidates or voters. Such control actions have been studied in the literature for a lot of prominent voting rules. We complement those results by solving several open cases for Copeland<jats:inline-formula><jats:alternatives><jats:tex-math>$$^{\\alpha }$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:msup><mml:mrow\/><mml:mi>\u03b1<\/mml:mi><\/mml:msup><\/mml:math><\/jats:alternatives><\/jats:inline-formula>, maximin,<jats:italic>k<\/jats:italic>-veto, plurality with runoff, veto with runoff, Condorcet, fallback, range voting, and normalized range voting.<\/jats:p>","DOI":"10.1007\/s10458-021-09523-9","type":"journal-article","created":{"date-parts":[[2021,7,29]],"date-time":"2021-07-29T07:02:51Z","timestamp":1627542171000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Towards completing the puzzle: complexity of control by replacing, adding, and deleting candidates or voters"],"prefix":"10.1007","volume":"35","author":[{"given":"G\u00e1bor","family":"Erd\u00e9lyi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc","family":"Neveling","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Reger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00f6rg","family":"Rothe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7731-6818","authenticated-orcid":false,"given":"Yongjie","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roman","family":"Zorn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,7,29]]},"reference":[{"key":"9523_CR1","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"R Ahuja","year":"1993","unstructured":"Ahuja, R., Magnanti, T., & Orlin, J. (1993). Network Flows: Theory, Algorithms, and Applications. New Jersey: Prentice-Hall."},{"key":"9523_CR2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804090","volume-title":"Computational Complexity: A Modern Approach","author":"S Arora","year":"2009","unstructured":"Arora, S., & Barak, B. (2009). Computational Complexity: A Modern Approach. Cambridge: Cambridge University Press."},{"key":"9523_CR3","doi-asserted-by":"crossref","unstructured":"Aziz, H., Gaspers, S., Mattei, N., Narodytska, N., & Walsh, T. (2013) Ties matter: Complexity of manipulation when tie-breaking with a random vote. In: Proceedings of the 27th AAAI Conference on Artificial Intelligence, pp. 74\u201380","DOI":"10.1609\/aaai.v27i1.8701"},{"key":"9523_CR4","doi-asserted-by":"crossref","unstructured":"Bang-Jensen, J., & Gutin, G. (2008). Digraphs: Theory. Berlin: Springer-Verlag.","DOI":"10.1007\/978-1-84800-998-1"},{"key":"9523_CR5","doi-asserted-by":"crossref","unstructured":"Bartholdi, J., & III., & Orlin, J. . (1991). Single transferable vote resists strategic voting. Social Choice and Welfare, 8(4), 341\u2013354.","DOI":"10.1007\/BF00183045"},{"key":"9523_CR6","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":"9523_CR7","doi-asserted-by":"crossref","unstructured":"Bartholdi, J., & III., 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":"9523_CR8","doi-asserted-by":"crossref","unstructured":"Baumeister, D., & Rothe, J. (2015). Preference aggregation by voting. In: J.\u00a0Rothe (ed.) Economics and Computation. An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division, Springer Texts in Business and Economics, chap.\u00a04, pp. 197\u2013325. Springer-Verlag","DOI":"10.1007\/978-3-662-47904-9_4"},{"issue":"52","key":"9523_CR9","doi-asserted-by":"publisher","first-page":"5425","DOI":"10.1016\/j.tcs.2009.05.029","volume":"410","author":"N Betzler","year":"2009","unstructured":"Betzler, N., & Uhlmann, J. (2009). Parameterized complexity of candidate control in elections and related digraph problems. Theoretical Computer Science, 410(52), 5425\u20135442.","journal-title":"Theoretical Computer Science"},{"key":"9523_CR10","doi-asserted-by":"crossref","unstructured":"Brams, S., & Sanver, R. (2009). Voting systems that combine approval and preference. In: S.\u00a0Brams, W.\u00a0Gehrlein, F.\u00a0Roberts (eds.) The Mathematics of Preference, Choice, and Order: Essays in Honor of Peter C. Fishburn, pp. 215\u2013237. Springer","DOI":"10.1007\/978-3-540-79128-7_12"},{"key":"9523_CR11","doi-asserted-by":"publisher","first-page":"937","DOI":"10.1613\/jair.5515","volume":"60","author":"J Chen","year":"2017","unstructured":"Chen, J., Faliszewski, P., Niedermeier, R., & Talmon, N. (2017). Elections with few voters: Candidate control can be easy. Journal of Artificial Intelligence Research, 60, 937\u20131002.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"9523_CR12","doi-asserted-by":"crossref","unstructured":"Conitzer, V., & Walsh, T. (2016). Barriers to manipulation in voting. In: F.\u00a0Brandt, V.\u00a0Conitzer, U.\u00a0Endriss, J.\u00a0Lang, A.\u00a0Procaccia (eds.) Handbook of Computational Social Choice, chap.\u00a06, pp. 127\u2013145. Cambridge University Press","DOI":"10.1017\/CBO9781107446984.007"},{"key":"9523_CR13","unstructured":"Downey, R., & Fellows, M. (2013). Parameterized Complexity (2nd ed.). Springer-Verlag."},{"key":"9523_CR14","doi-asserted-by":"crossref","unstructured":"Dwork, C., Kumar, R., Naor, M., & Sivakumar, D. (2001). Rank aggregation methods for the web. In: Proceedings of the 10th International World Wide Web Conference, pp. 613\u2013622","DOI":"10.1145\/371920.372165"},{"issue":"1\u20134","key":"9523_CR15","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1023\/A:1018924209812","volume":"20","author":"E Ephrati","year":"1997","unstructured":"Ephrati, E., & Rosenschein, J. (1997). A heuristic technique for multi-agent planning. Annals of Mathematics and Artificial Intelligence, 20(1\u20134), 13\u201367.","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"issue":"4","key":"9523_CR16","doi-asserted-by":"publisher","first-page":"632","DOI":"10.1016\/j.jcss.2014.11.002","volume":"81","author":"G Erd\u00e9lyi","year":"2015","unstructured":"Erd\u00e9lyi, G., Fellows, M., Rothe, J., & Schend, L. (2015). Control complexity in Bucklin and fallback voting: A theoretical analysis. Journal of Computer and System Sciences, 81(4), 632\u2013660.","journal-title":"Journal of Computer and System Sciences"},{"issue":"4","key":"9523_CR17","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1016\/j.jcss.2014.11.003","volume":"81","author":"G Erd\u00e9lyi","year":"2015","unstructured":"Erd\u00e9lyi, G., Fellows, M., Rothe, J., & Schend, L. (2015). Control complexity in Bucklin and fallback voting: An experimental analysis. Journal of Computer and System Sciences, 81(4), 661\u2013670.","journal-title":"Journal of Computer and System Sciences"},{"key":"9523_CR18","doi-asserted-by":"crossref","unstructured":"Erd\u00e9lyi, G., Hemaspaandra, E., & Hemaspaandra, L. (2015). More natural models of electoral control by partition. In: Proceedings of the 4th International Conference on Algorithmic Decision Theory, pp. 396\u2013413","DOI":"10.1007\/978-3-319-23114-3_24"},{"issue":"4","key":"9523_CR19","doi-asserted-by":"publisher","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":"9523_CR20","unstructured":"Erd\u00e9lyi, G., Piras, L., & Rothe, J. (2011). The complexity of voter partition in Bucklin and fallback voting: Solving three open problems. In: Proceedings of the 10th International Conference on Autonomous Agents and Multiagent Systems, pp. 837\u2013844"},{"key":"9523_CR21","unstructured":"Erd\u00e9lyi, G., Reger, C., & Yang, Y. (2019). Towards completing the puzzle: Solving open problems for control in elections. In: Proceedings of the 18th International Conference on Autonomous Agents and Multiagent Systems, pp. 846\u2013854"},{"key":"9523_CR22","unstructured":"Erd\u00e9lyi, G., & Rothe, J. (2010). Control complexity in fallback voting. In: Proceedings of Computing: the 16th Australasian Theory Symposium, pp. 39\u201348"},{"key":"9523_CR23","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1613\/jair.3136","volume":"40","author":"P Faliszewski","year":"2011","unstructured":"Faliszewski, P., Hemaspaandra, E., & Hemaspaandra, L. (2011). Multimode control attacks on elections. Journal of Artificial Intelligence Research, 40, 305\u2013351.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"9523_CR24","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"},{"key":"9523_CR25","doi-asserted-by":"crossref","unstructured":"Faliszewski, P., & Rothe, J. (2016). Control and bribery in voting. In: F.\u00a0Brandt, V.\u00a0Conitzer, U.\u00a0Endriss, J.\u00a0Lang, A.\u00a0Procaccia (eds.) Handbook of Computational Social Choice, chap.\u00a07, pp. 146\u2013168. Cambridge University Press","DOI":"10.1017\/CBO9781107446984.008"},{"key":"9523_CR26","doi-asserted-by":"crossref","unstructured":"Gabow, H. (1983). An efficient reduction technique for degree-constrained subgraph and bidirected network flow problems. In: Proceedings of the 15th ACM Symposium on Theory of Computing, pp. 448\u2013456","DOI":"10.1145\/800061.808776"},{"key":"9523_CR27","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. Freeman and Company: W. H."},{"key":"9523_CR28","doi-asserted-by":"crossref","unstructured":"Ghosh, S., Mundhe, M., Hernandez, K., & Sen, S. (1999). Voting for movies: The anatomy of recommender systems. In: Proceedings of the 3rd Annual Conference on Autonomous Agents, pp. 434\u2013435","DOI":"10.1145\/301136.301303"},{"key":"9523_CR29","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0304-3975(85)90224-5","volume":"38","author":"T Gonzalez","year":"1985","unstructured":"Gonzalez, T. (1985). Clustering to minimize the maximum intercluster distance. Theoretical Computer Science, 38, 293\u2013306.","journal-title":"Theoretical Computer Science"},{"key":"9523_CR30","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-97881-4","volume-title":"Geometric Algorithms and Combinatorial Optimization","author":"M Gr\u00f6tschel","year":"1988","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., & Schrijver, A. (1988). Geometric Algorithms and Combinatorial Optimization. Berlin: Springer."},{"key":"9523_CR31","unstructured":"Guo, J., & Shrestha, Y.R. (2014). Controlling two-stage voting rules. In: Proceedings of the 21st European Conference on Artificial Intelligence, pp. 411\u2013416"},{"key":"9523_CR32","doi-asserted-by":"crossref","unstructured":"Haynes, T., Sen, S., Arora, N., & Nadella, R. (1997). An automated meeting scheduling system that utilizes user preferences. In: Proceedings of the 1st International Conference on Autonomous Agents, pp. 308\u2013315","DOI":"10.1145\/267658.267733"},{"issue":"5\u20136","key":"9523_CR33","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. (2007). Anyone but him: The complexity of precluding an alternative. Artificial Intelligence, 171(5\u20136), 255\u2013285.","journal-title":"Artificial Intelligence"},{"key":"9523_CR34","doi-asserted-by":"crossref","unstructured":"Hemaspaandra, E., Hemaspaandra, L., & Schnoor, H. (2014). A control dichotomy for pure scoring rules. In: Proceedings of the 28th AAAI Conference on Artificial Intelligence, pp. 712\u2013720","DOI":"10.1609\/aaai.v28i1.8800"},{"key":"9523_CR35","doi-asserted-by":"crossref","unstructured":"Hemaspaandra, E., Hemaspaandra, L. A., & Menton, C. (2020). Search versus decision for election manipulation problems. ACM Transactions on Computation Theory, 12(1), 3:1-3:42.","DOI":"10.1145\/3369937"},{"key":"9523_CR36","unstructured":"Hemaspaandra, L. (2018). Computational social choice and computational complexity: BFFs? In: Proceedings of the 32nd AAAI Conference on Artificial Intelligence, pp. 7971\u20137977"},{"key":"9523_CR37","doi-asserted-by":"crossref","unstructured":"Karp, R. (1972). Reducibility among combinatorial problems. In: R.\u00a0Miller, J.\u00a0Thatcher (eds.) Complexity of Computer Computations, pp. 85\u2013103","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"9523_CR38","doi-asserted-by":"crossref","unstructured":"Lang, J., Maudet, N., & Polukarov, M. (2013). New results on equilibria in strategic candidacy. In: Proceedings of the 6th International Symposium on Algorithmic Game Theory, pp. 13\u201325","DOI":"10.1007\/978-3-642-41392-6_2"},{"key":"9523_CR39","unstructured":"Lin, A. (2011). The complexity of manipulating $$k$$-approval elections. In: Proceedings of the 3rd International Conference on Agents and Artificial Intelligence, pp. 212\u2013218"},{"key":"9523_CR40","unstructured":"Loreggia, A. (2012). Iterative voting and multi-mode control in preference aggregation. Master\u2019s thesis, University of Padova"},{"issue":"1","key":"9523_CR41","doi-asserted-by":"publisher","first-page":"39","DOI":"10.3233\/IA-140059","volume":"8","author":"A Loreggia","year":"2014","unstructured":"Loreggia, A. (2014). Iterative voting and multi-mode control in preference aggregation. Intelligenza Artificiale, 8(1), 39\u201351.","journal-title":"Intelligenza Artificiale"},{"key":"9523_CR42","unstructured":"Loreggia, A. (2016). Iterative voting, control and sentiment analysis. Ph.D. thesis, University of Padova"},{"key":"9523_CR43","unstructured":"Loreggia, A., Narodytska, N., Rossi, F., Venable, B., & Walsh, T. (2015). Controlling elections by replacing candidates or votes (extended abstract). In: Proceedings of the 14th International Conference on Autonomous Agents and Multiagent Systems, pp. 1737\u20131738"},{"issue":"3","key":"9523_CR44","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1007\/s10458-016-9339-3","volume":"31","author":"K Magiera","year":"2017","unstructured":"Magiera, K., & Faliszewski, P. (2017). How hard is control in single-crossing elections? Journal of Autonomous Agents and Multi-Agent Systems, 31(3), 606\u2013627.","journal-title":"Journal of Autonomous Agents and Multi-Agent Systems"},{"key":"9523_CR45","unstructured":"Maushagen, C., & Rothe, J. (2016). Complexity of control by partitioning veto and maximin elections and of control by adding candidates to plurality elections. In: Proceedings of the 22nd European Conference on Artificial Intelligence, pp. 277\u2013285"},{"issue":"4","key":"9523_CR46","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s10472-017-9565-7","volume":"82","author":"C Maushagen","year":"2018","unstructured":"Maushagen, C., & Rothe, J. (2018). Complexity of control by partitioning veto elections and of control by adding candidates to plurality elections. Annals of Mathematics and Artificial Intelligence, 82(4), 219\u2013244.","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"9523_CR47","unstructured":"Maushagen, C., & Rothe, J. (2020). The last voting rule is home: Complexity of control by partition of candidates or voters in maximin elections. In: Proceedings of the 24th European Conference on Artificial Intelligence, pp. 163\u2013170"},{"issue":"4","key":"9523_CR48","doi-asserted-by":"publisher","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":"9523_CR49","unstructured":"Menton, C., & Singh, P. (2013). Control complexity of Schulze voting. In: Proceedings of the 23rd International Joint Conference on Artificial Intelligence, pp. 286\u2013292"},{"key":"9523_CR50","doi-asserted-by":"crossref","unstructured":"Neveling, M., Rothe, J., & Zorn, R. (2020). The complexity of controlling Condorcet, fallback, and $$k$$-veto elections by replacing candidates or voters. In: Proceedings of the 15th International Computer Science Symposium in Russia, pp. 314\u2013327","DOI":"10.1007\/978-3-030-50026-9_23"},{"key":"9523_CR51","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. (2006). Invitation to Fixed-Parameter Algorithms. Oxford: Oxford University Press."},{"key":"9523_CR52","unstructured":"Obraztsova, S., Elkind, E., & Hazon, N. (2011). Ties matter: Complexity of voting manipulation revisited. In: Proceedings of the 22nd International Joint Conference on Artificial Intelligence, pp. 2698\u20132703"},{"key":"9523_CR53","doi-asserted-by":"crossref","unstructured":"Oflazer, K., & T\u00fcr, G. (1997). Morphological disambiguation by voting constraints. In: Proceedings of the 8th Conference of the European Chapter of the Association for Computational Linguistics, pp. 222\u2013229","DOI":"10.3115\/979617.979646"},{"key":"9523_CR54","unstructured":"Parkes, D., & Xia, L. (2012). A complexity-of-strategic-behavior comparison between Schulze\u2019s rule and ranked pairs. In: Proceedings of the 26th AAAI Conference on Artificial Intelligence, pp. 1429\u20131435"},{"key":"9523_CR55","unstructured":"Pennock, D., Horvitz, E., & Giles, C. (2000). Social choice theory and recommender systems: Analysis of the axiomatic foundations of collaborative filtering. In: Proceedings of the 17th National Conference on Artificial Intelligence, pp. 729\u2013734"},{"key":"9523_CR56","unstructured":"Rothe, J. (2005). Complexity Theory and Cryptology. An Introduction to Cryptocomplexity. EATCS Texts in Theoretical Computer Science. Springer-Verlag"},{"key":"9523_CR57","first-page":"1751","volume":"6","author":"G Sigletos","year":"2005","unstructured":"Sigletos, G., Paliouras, G., Spyropoulos, C., & Hatzopoulos, M. (2005). Combining information extraction systems using voting and stacked generalization. Journal of Machine Learning Research, 6, 1751\u20131782.","journal-title":"Journal of Machine Learning Research"},{"issue":"3","key":"9523_CR58","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1287\/inte.32.3.30.39","volume":"32","author":"C Tovey","year":"2002","unstructured":"Tovey, C. (2002). Tutorial on computational complexity. Interfaces, 32(3), 30\u201361.","journal-title":"Interfaces"},{"key":"9523_CR59","volume-title":"Introduction to Graph Theory","author":"D West","year":"2000","unstructured":"West, D. (2000). Introduction to Graph Theory. New Jersey: Prentice-Hall."},{"key":"9523_CR60","unstructured":"Yang, Y. (2017). The complexity of control and bribery in majority judgment. In: Proceedings of the 16th International Conference on Autonomous Agents and Multiagent Systems, pp. 1169\u20131177"},{"key":"9523_CR61","unstructured":"Yang, Y., & Guo, J. (2014).Controlling elections with bounded single-peaked width. In: Proceedings of the 13th International Conference on Autonomous Agents and Multiagent Systems, pp. 629\u2013636"},{"key":"9523_CR62","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1016\/j.jcss.2017.06.004","volume":"89","author":"Y Yang","year":"2017","unstructured":"Yang, Y., & Guo, J. (2017). The control complexity of $$r$$-approval: From the single-peaked case to the general case. Journal of Computer and System Sciences, 89, 432\u2013449.","journal-title":"Journal of Computer and System Sciences"},{"key":"9523_CR63","unstructured":"Yang, Y., & Wang, J. (2017). Anyone but them: The complexity challenge for a resolute election controller. In: Proceedings of the 16th International Conference on Autonomous Agents and Multiagent Systems, pp. 1133\u20131141"}],"container-title":["Autonomous Agents and Multi-Agent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-021-09523-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10458-021-09523-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-021-09523-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,5]],"date-time":"2023-01-05T20:41:08Z","timestamp":1672951268000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10458-021-09523-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,29]]},"references-count":63,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,10]]}},"alternative-id":["9523"],"URL":"https:\/\/doi.org\/10.1007\/s10458-021-09523-9","relation":{},"ISSN":["1387-2532","1573-7454"],"issn-type":[{"value":"1387-2532","type":"print"},{"value":"1573-7454","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,7,29]]},"assertion":[{"value":"2 July 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 July 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"41"}}