A Parameterized Perspective on Attacking and Defending Elections
From MaRDI portal
Publication:5041198
DOI10.1007/978-3-030-48966-3_21OpenAlexW3028657625MaRDI QIDQ5041198FDOQ5041198
Authors: Kishen N. Gowda, Neeldhara Misra, Vraj Patel
Publication date: 13 October 2022
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2005.03176
Recommendations
- A parameterized perspective on protecting elections
- Protecting elections by recounting ballots
- Computational complexity characterization of protecting elections from bribery
- Computational complexity characterization of protecting elections from bribery
- Elections with few voters: candidate control can be easy
Cites Work
- Parameterized algorithms
- On the parameterized complexity of multiple-interval graph problems
- On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems
- Title not available (Why is that?)
- Barriers to manipulation in voting
- Control and bribery in voting
- A parameterized perspective on protecting elections
- Protecting elections by recounting ballots
Cited In (2)
This page was built for publication: A Parameterized Perspective on Attacking and Defending Elections
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5041198)