How Hard Is It for a Party to Nominate an Election Winner?
Abstract
We consider a Plurality-voting scenario, where the candidates are split between parties, and each party nominates exactly one candidate for the final election. We study the computational complexity of deciding if there is a set of nominees such that a candidate from a given party wins in the final election. In our second problem, the goal is to decide if a candidate from a given party always wins, irrespective who is nominated. We show that these problems are computationally hard, but are polynomial-time solvable for restricted settings. PDF
Cite
Text
Faliszewski et al. "How Hard Is It for a Party to Nominate an Election Winner?." International Joint Conference on Artificial Intelligence, 2016.Markdown
[Faliszewski et al. "How Hard Is It for a Party to Nominate an Election Winner?." International Joint Conference on Artificial Intelligence, 2016.](https://mlanthology.org/ijcai/2016/faliszewski2016ijcai-hard/)BibTeX
@inproceedings{faliszewski2016ijcai-hard,
title = {{How Hard Is It for a Party to Nominate an Election Winner?}},
author = {Faliszewski, Piotr and Gourvès, Laurent and Lang, Jérôme and Lesca, Julien and Monnot, Jérôme},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2016},
pages = {257-263},
url = {https://mlanthology.org/ijcai/2016/faliszewski2016ijcai-hard/}
}