Proceedings

How Hard Is It for a Party to Nominate an Election Winner?

Download BibTeX Cite

Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence. Pages 257-262.

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.

Piotr Faliszewski, Laurent Gourvès, Jérôme Lang, Julien Lesca, and Jérôme Monnot. 2016. How Hard Is It for a Party to Nominate an Election Winner?. In Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI-16. IJCAI, 257–262. https://ijcai.org/proceedings/2016/44
Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards