On coalitional manipulation for multiwinner elections: shortlisting

Shortlisting of candidates—selecting a group of “best” candidates—is a special case of multiwinner elections. We provide the first in-depth study of the computational complexity of strategic voting for shortlisting based on the perhaps most basic voting rule in this scenario, ℓ -Bloc (every voter ap...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Autonomous agents and multi-agent systems Ročník 35; číslo 2
Hlavní autori: Bredereck, Robert, Kaczmarczyk, Andrzej, Niedermeier, Rolf
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: New York Springer US 01.10.2021
Springer Nature B.V
Predmet:
Artificial Intelligence
Complexity
Computer Science
Computer Systems Organization and Communication Networks
Egalitarianism
Elections
Software Engineering/Programming and Operating Systems
User Interfaces and Human Computer Interaction
Voting
Bloc
Computational social choice
Tie-breaking
Utility aggregation
Strategic voting
Parameterized computational complexity
SNTV
ISSN:1387-2532, 1573-7454
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:Shortlisting of candidates—selecting a group of “best” candidates—is a special case of multiwinner elections. We provide the first in-depth study of the computational complexity of strategic voting for shortlisting based on the perhaps most basic voting rule in this scenario, ℓ -Bloc (every voter approves ℓ  candidates). In particular, we investigate the influence of several different group evaluation functions (e.g., egalitarian versus utilitarian) and tie-breaking mechanisms modeling pessimistic and optimistic manipulators. Among other things, we conclude that in an egalitarian setting strategic voting may indeed be computationally intractable regardless of the tie-breaking rule. Altogether, we provide a fairly comprehensive picture of the computational complexity landscape of this scenario.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1387-2532
1573-7454
DOI:10.1007/s10458-021-09507-9