Szczegóły publikacji
Opis bibliograficzny
Weighted electoral control / Piotr FALISZEWSKI, Edith Hemaspaandra, Lane A. Hemaspaandra // W: AAMAS 2013 [Dokument elektroniczny] : proceedings of the 12th international conference on Autonomous Agents and Multiagent Systems : May, 6–10, 2013, Saint Paul, Minnesota, USA / eds. Takayuki Ito, [et al.]. — Wersja do Windows. — Dane tekstowe. — [USA] : International Foundation for Autonomous Agents and Multiagent Systems, cop. 2013. — Dysk Flash. — e-ISBN: 978-1-4503-1993-5. — S. 367–374. — Wymagania systemowe: Adobe Reader. — Bibliogr. s. 374, Abstr.
Autorzy (3)
- AGHFaliszewski Piotr
- Hemaspaandra Edith
- Hemaspaandra Lane A.
Słowa kluczowe
Dane bibliometryczne
| ID BaDAP | 74630 |
|---|---|
| Data dodania do BaDAP | 2013-08-09 |
| Rok publikacji | 2013 |
| Typ publikacji | materiały konferencyjne (aut.) |
| Otwarty dostęp |  |
| Konferencja | International Joint Conference on Autonomous Agents and Multiagent Systems 2013 |
Abstract
Although manipulation and bribery have been extensively studied under weighted voting, there has been almost no work done on election control under weighted voting. This is unfortunate, since weighted voting appears in many important natural settings. In this paper, we study the complexity of controlling the outcome of weighted elections through adding and deleting voters. We obtain polynomial-time algorithms, NP-completeness results, and for many NP-complete cases, approximation algorithms. Our work shows that for quite a few important cases, either polynomial-time exact algorithms or polynomial-time approximation algorithms exist. Copyright © 2013, International Foundation for Autonomous Agents and Multiagent Systems (www.ifaamas.org). All rights reserved.
