{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T09:11:45Z","timestamp":1743066705657,"version":"3.40.3"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031435867"},{"type":"electronic","value":"9783031435874"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-43587-4_13","type":"book-chapter","created":{"date-parts":[[2023,9,21]],"date-time":"2023-09-21T01:02:10Z","timestamp":1695258130000},"page":"176-189","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Complexity of\u00a0Conformant Election Manipulation"],"prefix":"10.1007","author":[{"given":"Zack","family":"Fitzsimmons","sequence":"first","affiliation":[]},{"given":"Edith","family":"Hemaspaandra","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,9,21]]},"reference":[{"issue":"3","key":"13_CR1","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/BF00295861","volume":"6","author":"J Bartholdi","year":"1989","unstructured":"Bartholdi, J., Tovey, C., Trick, M.: The computational difficulty of manipulating an election. Soc. Choice Welfare 6(3), 227\u2013241 (1989)","journal-title":"Soc. Choice Welfare"},{"issue":"8\/9","key":"13_CR2","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0895-7177(92)90085-Y","volume":"16","author":"J Bartholdi","year":"1992","unstructured":"Bartholdi, 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."},{"doi-asserted-by":"crossref","unstructured":"Baumeister, D., Roos, M., Rothe, J., Schend, L., Xia, L.: The possible winner problem with uncertain weights. In: Proceedings of the 20th European Conference on Artificial Intelligence, pp. 133\u2013138 (2012)","key":"13_CR3","DOI":"10.1016\/j.jcss.2023.103464"},{"issue":"8","key":"13_CR4","doi-asserted-by":"publisher","first-page":"812","DOI":"10.1016\/j.jcss.2010.04.002","volume":"76","author":"N Betzler","year":"2010","unstructured":"Betzler, N., Dorn, B.: Towards a dichotomy of finding possible winners in elections based on scoring rules. J. Comput. Syst. Sci. 76(8), 812\u2013836 (2010)","journal-title":"J. Comput. Syst. Sci."},{"unstructured":"Betzler, N., Niedermeier, R., Woeginger, G.: Unweighted coalitional manipulation under the Borda rule is NP-hard. In: Proceedings of the 22nd International Joint Conference on Artificial Intelligence, pp. 55\u201360 (2011)","key":"13_CR5"},{"issue":"1","key":"13_CR6","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1086\/256633","volume":"56","author":"D Black","year":"1948","unstructured":"Black, D.: On the rationale of group decision-making. J. Polit. Econ. 56(1), 23\u201334 (1948)","journal-title":"J. Polit. Econ."},{"unstructured":"Brelsford, E., Faliszewski, P., Hemaspaandra, E., Schnoor, H., Schnoor, I.: Approximability of manipulating elections. In: Proceedings of the 23rd National Conference on Artificial Intelligence, pp. 44\u201349 (2008)","key":"13_CR7"},{"issue":"3","key":"13_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1236457.1236461","volume":"54","author":"V Conitzer","year":"2007","unstructured":"Conitzer, V., Sandholm, T., Lang, J.: When are elections with few candidates hard to manipulate? J. ACM 54(3), 1\u201333 (2007)","journal-title":"J. ACM"},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.artint.2014.07.005","volume":"217","author":"J Davies","year":"2014","unstructured":"Davies, J., Katsirelos, G., Narodytska, N., Walsh, T., Xia, L.: Complexity of and algorithms for the manipulation of Borda, Nanson\u2019s and Baldwin\u2019s voting rules. Artif. Intell. 217, 20\u201342 (2014)","journal-title":"Artif. Intell."},{"key":"13_CR10","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.tcs.2017.02.031","volume":"676","author":"P Dey","year":"2017","unstructured":"Dey, P., Misra, N., Narahari, Y.: Frugal bribery in voting. Theor. Comput. Sci. 676, 15\u201332 (2017)","journal-title":"Theor. Comput. Sci."},{"doi-asserted-by":"crossref","unstructured":"Edmonds, J.: Maximum matching and a polyhedron with 0,1-vertices. J. Res. National Bureau Standards\u2013B. Math. Math. Phys. 69B(1\/2), 125\u2013130 (1965)","key":"13_CR11","DOI":"10.6028\/jres.069B.013"},{"unstructured":"Edmonds, J., Johnson, E.: Matching: a well-solved class of integer linear programs. In: Combinatorial Structures and Their Applications (Gordon and Breach), pp. 89\u201392 (1970)","key":"13_CR12"},{"issue":"41","key":"13_CR13","first-page":"1","volume":"35","author":"G Erd\u00e9lyi","year":"2021","unstructured":"Erd\u00e9lyi, G., Neveling, M., Reger, C., Rothe, J., Yang, Y., Zorn, R.: Towards completing the puzzle: complexity of control by replacing, adding, and deleting candidates or voters. Auton. Agent. Multi-Agent Syst. 35(41), 1\u201348 (2021)","journal-title":"Auton. Agent. Multi-Agent Syst."},{"key":"13_CR14","doi-asserted-by":"publisher","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."},{"doi-asserted-by":"crossref","unstructured":"Faliszewski, P., Rothe, J.: Control and bribery in voting. In: Handbook of Computational Social Choice, pp. 146\u2013168. Cambridge University Press (2016)","key":"13_CR15","DOI":"10.1017\/CBO9781107446984.008"},{"doi-asserted-by":"crossref","unstructured":"Fitzsimmons, Z., Hemaspaandra, E.: Insight into voting problem complexity using randomized classes. In: Proceedings of the 31st International Joint Conference on Artificial Intelligence, pp. 293\u2013299 (2022)","key":"13_CR16","DOI":"10.24963\/ijcai.2022\/42"},{"doi-asserted-by":"crossref","unstructured":"Fitzsimmons, Z., Hemaspaandra, E.: Complexity of conformant election manipulation. Tech. Rep. arXiv:2307.11689 [cs.GT], arXiv.org (2023)","key":"13_CR17","DOI":"10.1007\/978-3-031-43587-4_13"},{"doi-asserted-by":"crossref","unstructured":"Fitzsimmons, Z., Hemaspaandra, E.: Using weighted matching to solve 2-approval\/veto control and bribery. In: Proceedings of the 26th European Conference on Artificial Intelligence (2023), to appear","key":"13_CR18","DOI":"10.3233\/FAIA230338"},{"unstructured":"Garey, M., Johnson, D.: Computers and Intractability: a guide to the theory of NP-completeness. W. H, Freeman and Company (1979)","key":"13_CR19"},{"doi-asserted-by":"crossref","unstructured":"Gerards, A.: Matching. In: M.B. et al., (ed.) Handbooks in OR and MS Vol. 7, chap. 3, pp. 135\u2013224. Cambridge University Press (1995)","key":"13_CR20","DOI":"10.1016\/S0927-0507(05)80120-3"},{"doi-asserted-by":"crossref","unstructured":"Hemaspaandra, E., Hemaspaandra, L., Schnoor, H.: A control dichotomy for pure scoring rules. In: Proceedings of the 28th AAAI Conference on Artificial Intelligence, pp. 712\u2013720 (2014)","key":"13_CR21","DOI":"10.1609\/aaai.v28i1.8800"},{"unstructured":"Hemaspaandra, E., Schnoor, H.: Dichotomy for pure scoring rules under manipulative electoral actions. In: Proceedings of the 22nd European Conference on Artificial Intelligence, pp. 1071\u20131079 (2016)","key":"13_CR22"},{"doi-asserted-by":"crossref","unstructured":"Karp, R.: Reducibility among combinatorial problems. In: Proceedings of Symposium on Complexity of Computer Computations, pp. 85\u2013103 (1972)","key":"13_CR23","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"13_CR24","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/j.econlet.2018.08.013","volume":"172","author":"T Kurihara","year":"2018","unstructured":"Kurihara, T.: Axiomatic characterisations of the basic best-worst rule. Econ. Lett. 172, 19\u201322 (2018)","journal-title":"Econ. Lett."},{"doi-asserted-by":"crossref","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 (2011)","key":"13_CR25","DOI":"10.5220\/0003168802120218"},{"unstructured":"Loreggia, A., Narodytska, N., Rossi, F., Venable, K., Walsh, T.: Controlling elections by replacing candidates or votes. In: Proceedings of the 14th International Conference on Autonomous Agents and Multiagent Systems, pp. 1737\u20131738 (2015)","key":"13_CR26"},{"issue":"2","key":"13_CR27","doi-asserted-by":"publisher","first-page":"175","DOI":"10.2307\/2296779","volume":"38","author":"J Mirrlees","year":"1971","unstructured":"Mirrlees, J.: An exploration in the theory of optimum income taxation. Rev. Econ. Stud. 38(2), 175\u2013208 (1971)","journal-title":"Rev. Econ. Stud."},{"issue":"1","key":"13_CR28","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/BF02579206","volume":"7","author":"K Mulmuley","year":"1987","unstructured":"Mulmuley, K., Vazirani, U., Vazirani, V.: Matching is as easy as matrix inversion. Combinatorica 7(1), 105\u2013113 (1987)","journal-title":"Combinatorica"},{"doi-asserted-by":"crossref","unstructured":"Neveling, M., Rothe, J., Weishaupt, R.: The possible winner problem with uncertain weights revisited. In: Proceedings of the 23rd International Symposium on Fundamentals of Computation Theory, pp. 399\u2013412 (2021)","key":"13_CR29","DOI":"10.1007\/978-3-030-86593-1_28"},{"issue":"2","key":"13_CR30","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1145\/322307.322309","volume":"29","author":"C Papadimitriou","year":"1982","unstructured":"Papadimitriou, C., Yannakakis, M.: The complexity of restricted spanning tree problems. J. ACM 29(2), 285\u2013309 (1982)","journal-title":"J. ACM"},{"key":"13_CR31","doi-asserted-by":"publisher","first-page":"347","DOI":"10.4153\/CJM-1954-033-3","volume":"6","author":"W Tutte","year":"1954","unstructured":"Tutte, W.: A short proof of the factor theorem for finite graphs. Can. J. Math. 6, 347\u2013352 (1954)","journal-title":"Can. J. Math."},{"unstructured":"Walsh, T.: Uncertainty in preference elicitation and aggregation. In: Proceedings of the 22nd National Conference on Artificial Intelligence, pp. 3\u20138 (2007)","key":"13_CR32"},{"doi-asserted-by":"crossref","unstructured":"Xia, L.: Computing the margin of victory for various voting rules. In: Proceedings of the 12th ACM Conference on Electronic Commerce, pp. 982\u2013999 (2012)","key":"13_CR33","DOI":"10.1145\/2229012.2229086"},{"key":"13_CR34","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.tcs.2018.08.013","volume":"760","author":"Y Yang","year":"2019","unstructured":"Yang, Y., Shrestha, Y., Guo, J.: On the complexity of bribery with distance restrictions. Theor. Comput. Sci. 760, 55\u201371 (2019)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-43587-4_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,28]],"date-time":"2024-10-28T14:25:13Z","timestamp":1730125513000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-43587-4_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031435867","9783031435874"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-43587-4_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"21 September 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FCT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Fundamentals of Computation Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Trier","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fct2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.uni-trier.de\/index.php?id=71937&L=2","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":"EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"69","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":"30","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":"43% - 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":"3","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)"}}]}}