Towards completing the puzzle: complexity of control by replacing, adding, and deleting candidates or voters

Author:

Erdélyi Gábor,Neveling Marc,Reger Christian,Rothe Jörg,Yang YongjieORCID,Zorn Roman

Abstract

AbstractWe 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$$^{\alpha }$$ α , maximin, k-veto, plurality with runoff, veto with runoff, Condorcet, fallback, range voting, and normalized range voting.

Funder

Deutsche Forschungsgemeinschaft

Universität des Saarlandes

Publisher

Springer Science and Business Media LLC

Subject

Artificial Intelligence

Reference63 articles.

1. Ahuja, R., Magnanti, T., & Orlin, J. (1993). Network Flows: Theory, Algorithms, and Applications. New Jersey: Prentice-Hall.

2. Arora, S., & Barak, B. (2009). Computational Complexity: A Modern Approach. Cambridge: Cambridge University Press.

3. 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–80

4. Bang-Jensen, J., & Gutin, G. (2008). Digraphs: Theory. Berlin: Springer-Verlag.

5. Bartholdi, J., & III., & Orlin, J. . (1991). Single transferable vote resists strategic voting. Social Choice and Welfare, 8(4), 341–354.

Cited by 5 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. The possible winner with uncertain weights problem;Journal of Computer and System Sciences;2023-12

2. Hardness of candidate nomination;Autonomous Agents and Multi-Agent Systems;2023-08-16

3. Complexity of Conformant Election Manipulation;Fundamentals of Computation Theory;2023

4. Complexity of shift bribery for iterative voting rules;Annals of Mathematics and Artificial Intelligence;2022-08-09

5. Possible and Necessary Winner Problems in Iterative Elections with Multiple Rules;Frontiers of Algorithmic Wisdom;2022

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3