{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,20]],"date-time":"2025-06-20T04:08:54Z","timestamp":1750392534872,"version":"3.41.0"},"publisher-location":"Cham","reference-count":44,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031939297","type":"print"},{"value":"9783031939303","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-93930-3_13","type":"book-chapter","created":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T15:25:29Z","timestamp":1750346729000},"page":"217-236","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Search Versus Search for\u00a0Collapsing Electoral Control Types"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2369-4423","authenticated-orcid":false,"given":"Benjamin","family":"Carleton","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0510-6002","authenticated-orcid":false,"given":"Michael C.","family":"Chavrimootoo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0659-5204","authenticated-orcid":false,"given":"Lane A.","family":"Hemaspaandra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3704-1060","authenticated-orcid":false,"given":"David E.","family":"Narv\u00e1ez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7419-0391","authenticated-orcid":false,"given":"Conor","family":"Taliancich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8956-0554","authenticated-orcid":false,"given":"Henry B.","family":"Welles","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,6,20]]},"reference":[{"key":"13_CR1","unstructured":"Alouf-Heffetz, S., Inamdar, T., Jain, P., Talmon, N., Hiren, Y.M.: Controlling delegations in liquid democracy. In: Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems, pp. 2624\u20132632. International Foundation for Autonomous Agents and Multiagent Systems, May 2024"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Arora, S., Barak, B.: Computational Complexity: A Modern Approach. Cambridge University Press (2009)","DOI":"10.1017\/CBO9780511804090"},{"issue":"8\u20139","key":"13_CR3","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0895-7177(92)90085-Y","volume":"16","author":"JJ Bartholdi III","year":"1992","unstructured":"Bartholdi, J.J., III., Tovey, C.A., Trick, M.A.: How hard is it to control an election? Math. Comput. Model. 16(8\u20139), 27\u201340 (1992)","journal-title":"Math. Comput. Model."},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Baumeister, D., Erd\u00e9lyi, G., Hemaspaandra, E., Hemaspaandra, L.A., Rothe, J.: Computational aspects of approval voting. In: Laslier, J.F., Sanver, M.R. (eds.) Handbook on Approval Voting, pp. 199\u2013251. Springer (2010)","DOI":"10.1007\/978-3-642-02839-7_10"},{"issue":"3","key":"13_CR5","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1137\/0213030","volume":"13","author":"RV Book","year":"1984","unstructured":"Book, R.V., Long, T.J., Selman, A.L.: Quantitative relativizations of complexity classes. SIAM J. Comput. 13(3), 461\u2013487 (1984)","journal-title":"SIAM J. Comput."},{"key":"13_CR6","unstructured":"Borodin, A., Demers, A.: Some comments on functional self-reducibility and the NP hierarchy. Technical Report, TR 76-284, Department of Computer Science, Cornell University, Ithaca, NY, July 1976"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Carleton, B., Chavrimootoo, M., Hemaspaandra, L., Narv\u00e1ez, D., Taliancich, C., Welles, H.: Search versus search for collapsing electoral control types. Technical Report arXiv:2207.03049v6 [cs.GT], Computing Research Repository, arXiv.org\/corr\/, July 2022, Revised February 2024","DOI":"10.1613\/jair.1.15483"},{"key":"13_CR8","unstructured":"Carleton, B., Chavrimootoo, M.C., Hemaspaandra, L.A., Narv\u00e1ez, D.E., Taliancich, C., Welles, H.B.: Separating and collapsing electoral control types. Technical Report arXiv:2207.00710v4 [cs.MA], Computing Research Repository, arXiv.org\/corr\/, July 2022, Revised February 2023"},{"key":"13_CR9","unstructured":"Carleton, B., Chavrimootoo, M.C., Hemaspaandra, L.A., Narv\u00e1ez, D.E., Taliancich, C., Welles, H.B.: Search versus search for collapsing electoral control types (extended abstract). In: Proceedings of the 22nd International Conference on Autonomous Agents and Multiagent Systems, pp. 2682\u20132684. International Foundation for Autonomous Agents and Multiagent Systems, May\u2013June 2023"},{"key":"13_CR10","unstructured":"Carleton, B., Chavrimootoo, M.C., Hemaspaandra, L.A., Narv\u00e1ez, D.E., Taliancich, C., Welles, H.B.: Separating and collapsing electoral control types. In: Proceedings of the 22nd International Conference on Autonomous Agents and Multiagent Systems, pp. 1743\u20131751. International Foundation for Autonomous Agents and Multiagent Systems, May\u2013June 2023"},{"key":"13_CR11","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1613\/jair.1.15483","volume":"81","author":"B Carleton","year":"2024","unstructured":"Carleton, B., Chavrimootoo, M.C., Hemaspaandra, L.A., Narv\u00e1ez, D.E., Taliancich, C., Welles, H.B.: Separating and collapsing electoral control types. J Artif. Intell. Res. 81, 71\u2013116 (2024)","journal-title":"J Artif. Intell. Res."},{"issue":"4","key":"13_CR12","doi-asserted-by":"publisher","first-page":"422","DOI":"10.2307\/1907435","volume":"22","author":"H Chernoff","year":"1954","unstructured":"Chernoff, H.: Rational selection of decision functions. Econometrica 22(4), 422\u2013443 (1954)","journal-title":"Econometrica"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Colley, R., Grandi, U., Hidalgo, C., Macedo, M., Navarrete, C.: Measuring and controlling divisiveness in rank aggregation. In: Proceedings of the 32nd International Joint Conference on Artificial Intelligence, pp. 2616\u20132623. AAAI Press, August 2023","DOI":"10.24963\/ijcai.2023\/291"},{"key":"13_CR14","unstructured":"Erd\u00e9lyi, G., Piras, L., Rothe, J.: 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. International Foundation for Autonomous Agents and Multiagent Systems, May 2011"},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"Erd\u00e9lyi, G., Fellows, M.R., Rothe, J., Schend, L.: Control complexity in Bucklin and fallback voting: A theoretical analysis. J. Comput. Syst. Sci. 81(4), 632\u2013660 (2015)","DOI":"10.1016\/j.jcss.2014.11.002"},{"issue":"4","key":"13_CR16","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.: Sincere-strategy preference-based approval voting fully resists constructive control and broadly resists destructive control. Math. Log. Q. 55(4), 425\u2013443 (2009)","journal-title":"Math. Log. Q."},{"key":"13_CR17","unstructured":"Erd\u00e9lyi, G., Reger, C., Yang, Y.: 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. International Foundation for Autonomous Agents and Multiagent Systems (2019)"},{"key":"13_CR18","unstructured":"Erd\u00e9lyi, G., Rothe, J.: Control complexity in fallback voting. In: Proceedings the 16th Australasian Theory Symposium, pp. 39\u201348. Australian Computer Society, January 2010"},{"key":"13_CR19","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.A.: Weighted electoral control. J. Artif. Intell. Res. 52, 507\u2013542 (2015)","journal-title":"J. Artif. Intell. Res."},{"key":"13_CR20","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.A., 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":"13_CR21","doi-asserted-by":"crossref","unstructured":"Faliszewski, P., Rothe, J.: Control and bribery in voting. In: Brandt, F., Conitzer, V., Endriss, U., Lang, J., Procaccia, A.D. (eds.) Handbook of Computational Social Choice, pp. 146\u2013168. Cambridge University Press (2016)","DOI":"10.1017\/CBO9781107446984.008"},{"key":"13_CR22","doi-asserted-by":"crossref","unstructured":"Goldreich, O.: Computational Complexity: A Conceptual Perspective. Cambridge University Press (2008)","DOI":"10.1017\/CBO9780511804106"},{"key":"13_CR23","doi-asserted-by":"crossref","unstructured":"Gupta, S., Roy, S., Saurabh, S., Zehavi, M.: Resolute control: Forbidding candidates from winning an election is hard. Theoret. Comput. Sci. 915, 74\u201389 (2022)","DOI":"10.1016\/j.tcs.2022.02.031"},{"issue":"1\u20133","key":"13_CR24","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0304-3975(88)90022-9","volume":"58","author":"J Hartmanis","year":"1988","unstructured":"Hartmanis, J., Hemachandra, L.A.: Complexity classes without machines: On complete languages for UP. Theoret. Comput. Sci. 58(1\u20133), 129\u2013142 (1988)","journal-title":"Theoret. Comput. Sci."},{"key":"13_CR25","doi-asserted-by":"crossref","unstructured":"Hemaspaandra, E., Hemaspaandra, L.A., Menton, C.: Search versus decision for election manipulation problems. ACM Trans. Comput. Theor. 12(#1, Article 3), 1\u201342 (2020)","DOI":"10.1145\/3369937"},{"key":"13_CR26","doi-asserted-by":"crossref","unstructured":"Hemaspaandra, E., Hemaspaandra, L.A., Rothe, J.: Anyone but him: The complexity of precluding an alternative. Artif. Intell. 171(5\u20136), 255\u2013285 (2007)","DOI":"10.1016\/j.artint.2007.01.005"},{"issue":"4","key":"13_CR27","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1145\/3577971.3577977","volume":"53","author":"LA Hemaspaandra","year":"2022","unstructured":"Hemaspaandra, L.A.: Juris Hartmanis and two golden rules. SIGACT News 53(4), 35\u201340 (2022)","journal-title":"SIGACT News"},{"issue":"3\u20134","key":"13_CR28","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s10472-015-9479-1","volume":"77","author":"LA Hemaspaandra","year":"2016","unstructured":"Hemaspaandra, L.A., Lavaee, R., Menton, C.: Schulze and ranked-pairs voting are fixed-parameter tractable to bribe, manipulate, and control. Ann. Math. Artif. Intell. 77(3\u20134), 191\u2013223 (2016)","journal-title":"Ann. Math. Artif. Intell."},{"key":"13_CR29","unstructured":"Henry (455): Levin reduction, March 2013, https:\/\/planetmath.org\/levinreduction, Accessed 13 May 2024"},{"key":"13_CR30","doi-asserted-by":"publisher","unstructured":"Kaczmarek, J., Rothe, J.: Controlling weighted voting games by deleting or adding players with or without changing the quota. Ann. Math. Artif. Intell. (2023). https:\/\/doi.org\/10.1007\/s10472-023-09874-x","DOI":"10.1007\/s10472-023-09874-x"},{"key":"13_CR31","unstructured":"Kaczmarek, J., Rothe, J.: NP$$ ^{{\\rm PP}}$$-completeness of control by adding players to change the Penrose\u2013Banzhaf power index in weighted voting games (extended abstract). In: Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems, pp. 2318\u20132320. International Foundation for Autonomous Agents and Multiagent Systems, May 2024"},{"key":"13_CR32","doi-asserted-by":"crossref","unstructured":"Kaczmarek, J., Rothe, J., Talmon, N.: Complexity of control by adding or deleting edges in graph-restricted weighted voting games. In: Proceedings of the 26th European Conference on Artificial Intelligence, pp. 1190\u20131197. IOS Press, September 2023","DOI":"10.3233\/FAIA230395"},{"key":"13_CR33","unstructured":"Lin, A.: Solving Hard Problems in Election Systems. Ph.D. thesis, Rochester Institute of Technology, Rochester, NY (2012)"},{"key":"13_CR34","doi-asserted-by":"crossref","unstructured":"Maushagen, C., Niclaus, D., N\u00fcsken, P., Rothe, J., Seeger, T.: Toward completing the picture of control in Schulze and Ranked Pairs elections. In: Proceedings of the 33rd International Joint Conference on Artificial Intelligence, pp. 2940\u20132948. AAAI Press, August 2024","DOI":"10.24963\/ijcai.2024\/326"},{"issue":"4","key":"13_CR35","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.: Complexity of control by partitioning veto elections and of control by adding candidates to plurality elections. Ann. Math. Artif. Intell. 82(4), 219\u2013244 (2018)","journal-title":"Ann. Math. Artif. Intell."},{"issue":"2","key":"13_CR36","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/0304-3975(91)90200-L","volume":"81","author":"N Megiddo","year":"1991","unstructured":"Megiddo, N., Papadimitriou, C.H.: On total functions, existence theorems and computational complexity. Theoret. Comput. Sci. 81(2), 317\u2013324 (1991)","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"13_CR37","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/s00224-012-9441-0","volume":"53","author":"C Menton","year":"2013","unstructured":"Menton, C.: Normalized range voting broadly resists control. Theor. Comput. Syst. 53(4), 507\u2013531 (2013)","journal-title":"Theor. Comput. Syst."},{"key":"13_CR38","doi-asserted-by":"crossref","unstructured":"Parkes, D.C., 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, pp. 1429\u20131435. AAAI Press, August 2012","DOI":"10.1609\/aaai.v26i1.8258"},{"key":"13_CR39","unstructured":"Piterman, N., Fisman, D.: Introduction to complexity theory: Lecture 2: NP-completeness and self reducibility (1998), Lecture Notes for a course given by Oded Goldreich; notes taken by N. Piterman and D. Fisman, https:\/\/www.wisdom.weizmann.ac.il\/%7Eoded\/PS\/CC\/l2.ps, Accessed 13 May 2024"},{"issue":"3","key":"13_CR40","doi-asserted-by":"publisher","first-page":"307","DOI":"10.2307\/2296384","volume":"38","author":"AK Sen","year":"1971","unstructured":"Sen, A.K.: Choice functions and revealed preference. Rev. Econ. Stud. 38(3), 307\u2013317 (1971)","journal-title":"Rev. Econ. Stud."},{"issue":"1","key":"13_CR41","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/0020-0190(76)90097-1","volume":"5","author":"LG Valiant","year":"1976","unstructured":"Valiant, L.G.: The relative complexity of checking and evaluating. Inf. Process. Lett. 5(1), 20\u201323 (1976)","journal-title":"Inf. Process. Lett."},{"key":"13_CR42","unstructured":"Yang, Y.: On the complexity of controlling amendment and successive winners (extended abstract). In: Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems, pp. 1768\u20131770. International Foundation for Autonomous Agents and Multiagent Systems, May 2022"},{"key":"13_CR43","unstructured":"Yang, Y.: On the complexity of two-stage majoritarian rules. In: Proceedings of the 22nd International Conference on Autonomous Agents and Multiagent Systems, pp. 2022\u20132030. International Foundation for Autonomous Agents and Multiagent Systems, May\u2013June 2023"},{"key":"13_CR44","doi-asserted-by":"crossref","unstructured":"Yang, Y.: How hard is it to impact the impact of your paper? In: Proceedings of the 33rd International Joint Conference on Artificial Intelligence, pp. 3023\u20133031. AAAI Press, August 2024","DOI":"10.24963\/ijcai.2024\/335"}],"container-title":["Lecture Notes in Computer Science","Multi-Agent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-93930-3_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T15:25:41Z","timestamp":1750346741000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-93930-3_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031939297","9783031939303"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-93930-3_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"20 June 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUMAS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Multi-Agent Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dublin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ireland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 August 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eumas2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/euramas.github.io\/eumas2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}