{"type":"ScholarlyArticle","title":"How Hard Is It for a Party to Nominate an Election Winner?","authors":[{"name":"Piotr Faliszewski","slug":"piotr-faliszewski","given":"Piotr","family":"Faliszewski","affiliation":""},{"name":"Laurent Gourvès","slug":"laurent-gourves","given":"Laurent","family":"Gourvès","affiliation":""},{"name":"Jérôme Lang","slug":"jerome-lang","given":"Jérôme","family":"Lang","affiliation":""},{"name":"Julien Lesca","slug":"julien-lesca","given":"Julien","family":"Lesca","affiliation":""},{"name":"Jérôme Monnot","slug":"jerome-monnot","given":"Jérôme","family":"Monnot","affiliation":""}],"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.","doi":null,"url":"https://ijcai.org/proceedings/2016/44","pdf":"https://ijcai.org/proceedings/2016/0044.pdf","markdown":"https://ijcai.org/proceedings/2016/44.md","bibtex":"https://ijcai.org/proceedings/2016/bibtex/44","volume":{"slug":"2016","title":"Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2016","url":"https://ijcai.org/proceedings/2016/","year":2016,"location":"New York, NY, USA","dates":"9–15 July 2016","editors":"Subbarao Kambhampati","isbn":"978-1-57735-770-4; 978-1-57735-771-1","publisher":"AAAI Press / International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":44,"pages":{"first":257,"last":262},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}