Multiwinner analogues of the plurality rule: axiomatic and algorithmic perspectives

We characterize the class of committee scoring rules that satisfy the fixed-majority criterion. We argue that rules in this class are multiwinner analogues of the single-winner Plurality rule, which is uniquely characterized as the only single-winner scoring rule that satisfies the simple majority c...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Social choice and welfare Ročník 51; číslo 3; s. 513 - 550
Hlavní autoři: Faliszewski, Piotr, Skowron, Piotr, Slinko, Arkadii, Talmon, Nimrod
Médium: Journal Article
Jazyk:angličtina
Vydáno: Berlin/Heidelberg Springer 01.10.2018
Springer Berlin Heidelberg
Springer Nature B.V
Témata:
Algorithms
Committees
Counting
Economic Theory/Quantitative Economics/Mathematical Methods
Economics
Economics and Finance
Game Theory
International Political Economy
Majority rule
Original Paper
Public Finance
Rules
Scores
Social and Behav. Sciences
Social Policy
ISSN:0176-1714, 1432-217X
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í:We characterize the class of committee scoring rules that satisfy the fixed-majority criterion. We argue that rules in this class are multiwinner analogues of the single-winner Plurality rule, which is uniquely characterized as the only single-winner scoring rule that satisfies the simple majority criterion. We define top-k-counting committee scoring rules and show that the fixed-majority consistent rules are a subclass of the top-k-counting rules. We give necessary and sufficient conditions for a top-k-counting rule to satisfy the fixed-majority criterion. We show that, for many top-k-counting rules, the complexity of winner determination is high (formally, we show that the problem of deciding if there exists a committee with at least a given score is NP-hard), but we also show examples of rules with polynomial-time winner determination procedures. For some of the computationally hard rules, we provide either exact FPT algorithms or approximate polynomial-time algorithms.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0176-1714
1432-217X
DOI:10.1007/s00355-018-1126-4