{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:05:40Z","timestamp":1742911540880,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030500252"},{"type":"electronic","value":"9783030500269"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-50026-9_23","type":"book-chapter","created":{"date-parts":[[2020,6,21]],"date-time":"2020-06-21T23:02:43Z","timestamp":1592780563000},"page":"314-327","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The Complexity of Controlling Condorcet, Fallback, and k-Veto Elections by Replacing Candidates or Voters"],"prefix":"10.1007","author":[{"given":"Marc","family":"Neveling","sequence":"first","affiliation":[]},{"given":"J\u00f6rg","family":"Rothe","sequence":"additional","affiliation":[]},{"given":"Roman","family":"Zorn","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,6,22]]},"reference":[{"issue":"8\/9","key":"23_CR1","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. Modell. 16(8\/9), 27\u201340 (1992)","journal-title":"Math. Comput. Modell."},{"key":"23_CR2","unstructured":"Baumeister, D., Erd\u00e9lyi, G., Erd\u00e9lyi, O., Rothe, J.: Control in judgment aggregation. In: Proceedings of the 6th European Starting AI Researcher Symposium, pp. 23\u201334. IOS Press, August 2012"},{"key":"23_CR3","series-title":"Springer Texts in Business and Economics","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/978-3-662-47904-9_4","volume-title":"Economics and Computation","author":"D Baumeister","year":"2016","unstructured":"Baumeister, D., Rothe, J.: Preference aggregation by voting. In: Rothe, J. (ed.) Economics and Computation. STBE, pp. 197\u2013325. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-47904-9_4"},{"key":"23_CR4","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1007\/978-3-319-23114-3_26","volume-title":"Algorithmic Decision Theory","author":"D Baumeister","year":"2015","unstructured":"Baumeister, D., Rothe, J., Selker, A.-K.: Complexity of bribery and control for uniform premise-based quota rules under various preference types. In: Walsh, T. (ed.) ADT 2015. LNCS (LNAI), vol. 9346, pp. 432\u2013448. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-23114-3_26"},{"key":"23_CR5","series-title":"Studies in Choice and Welfare","doi-asserted-by":"publisher","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.: Voting systems that combine approval and preference. In: Brams, S., Gehrlein, W., Roberts, F. (eds.) The Mathematics of Preference, Choice, and Order: Essays in Honor of Peter C. Fishburn. Studies in Choice and Welfare, pp. 215\u2013237. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-540-79128-7_12"},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"Chen, J., Faliszewski, P., Niedermeier, R., Talmon, N.: Elections with few voters: candidate control can be easy. In: Proceedings of the 29th AAAI Conference on Artificial Intelligence, pp. 2045\u20132051. AAAI Press (Jan 2015)","DOI":"10.1609\/aaai.v29i1.9429"},{"issue":"4","key":"23_CR7","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.: Control complexity in Bucklin and fallback voting: a theoretical analysis. J. Comput. Syst. Sci. 81(4), 632\u2013660 (2015)","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"23_CR8","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.: Control complexity in Bucklin and fallback voting: an experimental analysis. J. Comput. Syst. Sci. 81(4), 661\u2013670 (2015)","journal-title":"J. Comput. Syst. Sci."},{"key":"23_CR9","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, IFAAMAS, pp. 837\u2013844, May 2011"},{"key":"23_CR10","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, IFAAMAS, pp. 846\u2013854, May 2019"},{"key":"23_CR11","unstructured":"Erd\u00e9lyi, G., Rothe, J.: Control complexity in fallback voting. In: Proceedings of Computing: the 16th Australasian Theory Symposium, Australian Computer Society Conferences in Research and Practice in Information Technology Series, vol. 32, no. 8, pp. 39\u201348, January 2010"},{"key":"23_CR12","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.: Multimode control attacks on elections. J. Artif. Intell. Res. 40, 305\u2013351 (2011)","journal-title":"J. Artif. Intell. Res."},{"key":"23_CR13","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. (eds.) Handbook of Computational Social Choice, chap. 7, pp. 146\u2013168. Cambridge University Press (2016)","DOI":"10.1017\/CBO9781107446984.008"},{"key":"23_CR14","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H Freeman and Company, New York (1979)"},{"issue":"5\u20136","key":"23_CR15","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":"23_CR16","unstructured":"Lin, A.: The complexity of manipulating $$k$$-approval elections. In: Proceedings of the 3rd International Conference on Agents and Artificial Intelligence, pp. 212\u2013218. SciTePress, January 2011"},{"key":"23_CR17","unstructured":"Lin, A.: Solving hard problems in election systems. Ph.D. thesis, Rochester Institute of Technology, Rochester, NY, USA, March 2012"},{"issue":"1","key":"23_CR18","doi-asserted-by":"publisher","first-page":"39","DOI":"10.3233\/IA-140059","volume":"8","author":"A Loreggia","year":"2014","unstructured":"Loreggia, A.: Iterative voting and multi-mode control in preference aggregation. Intelligenza Artificiale 8(1), 39\u201351 (2014)","journal-title":"Intelligenza Artificiale"},{"key":"23_CR19","unstructured":"Loreggia, A., Narodytska, N., Rossi, F., Venable, B., Walsh, T.: Controlling elections by replacing candidates or votes (extended abstract). In: Proceedings of the 14th International Conference on Autonomous Agents and Multiagent Systems, IFAAMAS, pp. 1737\u20131738, May 2015"},{"key":"23_CR20","unstructured":"Maushagen, C., Rothe, J.: 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. IOS Press, August\/September 2016"},{"key":"23_CR21","unstructured":"Maushagen, C., Rothe, J.: Complexity of control by partition of voters and of voter groups in veto and other scoring protocols. In: Proceedings of the 16th International Conference on Autonomous Agents and Multiagent Systems, IFAAMAS, pp. 615\u2013623, May 2017"},{"issue":"4","key":"23_CR22","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s10472-017-9565-7","volume":"82","author":"C Maushagen","year":"2017","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 (2017). https:\/\/doi.org\/10.1007\/s10472-017-9565-7","journal-title":"Ann. Math. Artif. Intell."},{"issue":"4","key":"23_CR23","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. Theory Comput. Syst. 53(4), 507\u2013531 (2013). https:\/\/doi.org\/10.1007\/s00224-012-9441-0","journal-title":"Theory Comput. Syst."},{"issue":"1\u20133","key":"23_CR24","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). https:\/\/doi.org\/10.1007\/s10472-013-9359-5","journal-title":"Ann. Math. Artif. Intell."},{"issue":"1\u20132","key":"23_CR25","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/s10472-011-9255-9","volume":"62","author":"T Walsh","year":"2011","unstructured":"Walsh, T.: Is computational complexity a barrier to manipulation? Ann. Math. Artif. Intell. 62(1\u20132), 7\u201326 (2011). https:\/\/doi.org\/10.1007\/s10472-011-9255-9","journal-title":"Ann. Math. Artif. Intell."},{"key":"23_CR26","first-page":"1","volume":"42","author":"T Walsh","year":"2011","unstructured":"Walsh, T.: Where are the hard manipulation problems? J. Artif. Intell. Res. 42, 1\u201329 (2011)","journal-title":"J. Artif. Intell. Res."}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-50026-9_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,29]],"date-time":"2022-10-29T17:59:07Z","timestamp":1667066347000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-50026-9_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030500252","9783030500269"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-50026-9_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"22 June 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CSR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computer Science Symposium in Russia","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Yekaterinburg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"csr2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/csr2020.sciencesconf.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"49","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"51% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":">= 3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was cancelled as a live conference due to the corona pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}