Elections with Few Voters: Candidate Control Can Be Easy
Abstract
We study the computational complexity of candidate control in elections with few voters (that is, we take the number of voters as a parameter). We consider both the standard scenario of adding and deleting candidates, where one asks if a given candidate can become a winner (or, in the destructive case, can be precluded from winning) by adding/deleting some candidates, and a combinatorial scenario where adding/deleting a candidate automatically means adding/deleting a whole group of candidates. Our results show that the parameterized complexity of candidate control (with the number of voters as the parameter) is much more varied than in the setting with many voters.
Cite
Text
Chen et al. "Elections with Few Voters: Candidate Control Can Be Easy." Journal of Artificial Intelligence Research, 2017. doi:10.1613/JAIR.5515Markdown
[Chen et al. "Elections with Few Voters: Candidate Control Can Be Easy." Journal of Artificial Intelligence Research, 2017.](https://mlanthology.org/jair/2017/chen2017jair-elections/) doi:10.1613/JAIR.5515BibTeX
@article{chen2017jair-elections,
title = {{Elections with Few Voters: Candidate Control Can Be Easy}},
author = {Chen, Jiehua and Faliszewski, Piotr and Niedermeier, Rolf and Talmon, Nimrod},
journal = {Journal of Artificial Intelligence Research},
year = {2017},
pages = {937-1002},
doi = {10.1613/JAIR.5515},
volume = {60},
url = {https://mlanthology.org/jair/2017/chen2017jair-elections/}
}