Resolute control: forbidding candidates from winning an election is hard
From MaRDI portal
Publication:2143123
DOI10.1016/j.tcs.2022.02.031OpenAlexW4214816249MaRDI QIDQ2143123
Sushmita Gupta, Saket Saurabh, Meirav Zehavi, Sanjukta Roy
Publication date: 31 May 2022
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2022.02.031
Cites Work
- Unnamed Item
- Fundamentals of parameterized complexity
- On making a distinguished vertex of minimum degree by vertex deletion
- Parameterized complexity of control problems in Maximin election
- Kernelization complexity of possible winner and coalitional manipulation problems in voting
- 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?
- The computational difficulty of manipulating an election
- Combinatorial voter control in elections
- Challenges to complexity shields that are supposed to protect elections against manipulation and control: a survey
- Large-Scale Election Campaigns: Combinatorial Shift Bribery
- Computational Aspects of Approval Voting
- Studies in Computational Aspects of Voting
- Multimode Control Attacks on Elections
- Sincere-Strategy Preference-Based Approval Voting Fully Resists Constructive Control and Broadly Resists Destructive Control
- When are elections with few candidates hard to manipulate?
- Elections with Few Voters: Candidate Control Can Be Easy
- Control and Bribery in Voting
- A Multivariate Complexity Analysis of Lobbying in Multiple Referenda
- Parameterized Algorithms
- Robustness among multiwinner voting rules
This page was built for publication: Resolute control: forbidding candidates from winning an election is hard
