Campaign Management Under Approval-Driven Voting Rules

Approval-like voting rules, such as sincere-strategy preference-based approval voting (SP-AV), the Bucklin rule (an adaptive variant of k -approval voting), and the Fallback rule (a hybrid of the Bucklin rule and SP-AV) have many desirable properties: for example, they are easy to understand and enc...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Algorithmica Ročník 77; číslo 1; s. 84 - 115
Hlavní autoři: Schlotter, Ildiko, Faliszewski, Piotr, Elkind, Edith
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Springer US 01.01.2017
Springer Nature B.V
Témata:
Algorithm Analysis and Problem Complexity
Algorithms
Computer Science
Computer Systems Organization and Communication Networks
Data Structures and Information Theory
Management
Mathematics of Computing
Theory of Computation
Voters
Voting
Bribery
Campaign management
Bucklin voting
Fallback voting
Parameterized complexity
Approval voting
ISSN:0178-4617, 1432-0541
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Approval-like voting rules, such as sincere-strategy preference-based approval voting (SP-AV), the Bucklin rule (an adaptive variant of k -approval voting), and the Fallback rule (a hybrid of the Bucklin rule and SP-AV) have many desirable properties: for example, they are easy to understand and encourage the candidates to choose electoral platforms that have a broad appeal. In this paper, we investigate both classic and parameterized computational complexity of electoral campaign management under such rules. We focus on two methods that can be used to promote a given candidate: asking voters to move this candidate upwards in their preference order or asking them to change the number of candidates they approve of. We show that finding an optimal campaign management strategy of the first type is easy for both Bucklin and Fallback. In contrast, the second method is computationally hard even if the degree to which we need to affect the votes is small. Nevertheless, we identify a large class of scenarios that admit fixed-parameter tractable algorithms.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0178-4617
1432-0541
DOI:10.1007/s00453-015-0064-0