Parameterized complexity of control by voter selection in Maximin, Copeland, Borda, Bucklin, and Approval election systems
From MaRDI portal
Publication:391210
DOI10.1016/j.tcs.2013.05.019zbMath1297.93026OpenAlexW1964053454MaRDI QIDQ391210
Publication date: 10 January 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2013.05.019
Related Items
Control complexity in Borda elections: solving all open cases of offline control and some cases of online control ⋮ A parameterized perspective on protecting elections ⋮ Exact algorithms for weighted and unweighted Borda manipulation problems ⋮ Parameterized complexity of voter control in multi-peaked elections
Cites Work
- Unnamed Item
- Unnamed Item
- Parameterized complexity of control problems in Maximin election
- Anyone but him: the complexity of precluding an alternative
- Parameterized computational complexity of control problems in voting systems
- Parameterized complexity of candidate control in elections and related digraph problems
- How hard is it to control an election?
- Handbook of social choice and welfare. Vol. 1.
- On complexity of lobbying in multiple referenda
- Multimode Control Attacks on Elections
- Llull and Copeland Voting Computationally Resist Bribery and Constructive Control
- How Hard Is Bribery in Elections?