Szczegóły publikacji
Opis bibliograficzny
The complexity of manipulative attacks in nearly single-peaked electorates (extended abstract) / Piotr FALISZEWSKI, Edith Hemaspaandra, Lane A. Hemaspaandra // W: IJCAI-15 [Dokument elektroniczny] : proceedings of the Twenty-fourth International Joint Conference on Artificial Intelligence : Buenos Aires, Argentina, 25–31 July 2015 / eds. Qiang Yang, Michael Wooldridge. — Wersja do Windows. — Dane tekstowe. — Palo Alto : AAAI Press, cop. 2015. — e-ISBN: 978-157735738-4. — S. 4178–4182. — Wymagania systemowe: Adobe Reader. — Tryb dostępu: http://ijcai.org/papers15/Papers/IJCAI15-591.pdf [2015-09-08]. — Bibliogr. s. 4181–4182, Abstr.
Autorzy (3)
- AGHFaliszewski Piotr
- Hemaspaandra Edith
- Hemaspaandra Lane A.
Dane bibliometryczne
| ID BaDAP | 91586 |
|---|---|
| Data dodania do BaDAP | 2015-10-08 |
| Rok publikacji | 2015 |
| Typ publikacji | materiały konferencyjne (aut.) |
| Otwarty dostęp |  |
| Konferencja | International Joint Conference on Artificial Intelligence 2015 |
Abstract
Many electoral control and manipulation problems - which we will refer to in general as "manipulative actions" problems - are NP-hard in the general case. Many of these problems fall into polynomial time if the electorate is single-peaked, i.e., is polarized along some axis/issue. However, real-world electorates are not truly single-peaked - for example, there may be some maverick voters - and to take this into account, we study the complexity of manipulative-action algorithms for the case of nearly single-peaked electorates.
