Szczegóły publikacji
Opis bibliograficzny
How hard is it for a party to nominate an election winner? / Piotr FALISZEWSKI, Laurent Gourvès, Jérôme Lang, Julien Lesca, Jérôme Monnot // W: IJCAI-16 [Dokument elektroniczny] : proceedings of the twenty-fifth International Joint Conference on Artificial Intelligence : New York, USA 9–15 July 2016 / ed. Subbarao Kambhampati. — Wersja do Windows. — Dane tekstowe. — Palo Alto, USA : AAAI Press / International Joint Conferences on Artificial Intelligence, 2016. — ISBN: 978-1-57735-770-4; e-ISBN: 978-1-57735-771-1. — S. 257–263. — Wymagania systemowe: Adobe Reader. — Tryb dostępu: http://www.ijcai.org/Proceedings/16/Papers/044.pdf [2016-10-14]. — Bibliogr. s. 263, Abstr.
Autorzy (5)
- AGHFaliszewski Piotr
- Gourvès Laurent
- Lang Jérôme
- Lesca Julien
- Monnot Jérôme
Dane bibliometryczne
| ID BaDAP | 101394 |
|---|---|
| Data dodania do BaDAP | 2016-11-05 |
| Rok publikacji | 2016 |
| Typ publikacji | materiały konferencyjne (aut.) |
| Otwarty dostęp |  |
| Konferencja | International Joint Conference on Artificial Intelligence 2016 |
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.
