TY - GEN
T1 - Multiwinner analogues of the plurality rule
T2 - 30th AAAI Conference on Artificial Intelligence, AAAI 2016
AU - Faliszewski, Piotr
AU - Skowron, Piotr
AU - Slinko, Arkadii
AU - Talmon, Nimrod
N1 - Publisher Copyright:
© 2016, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.
PY - 2016/1/1
Y1 - 2016/1/1
N2 - We characterize the class of committee scoring rules that satisfy the fixed-majority criterion. In some sense, the committee scoring 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 find that, for most of the rules in our new class, the complexity of winner determination is high (i.e., the problem of computing the winners is NP-hard), but we also show some examples of polynomial-time winner determination procedures, exact and approximate.
AB - We characterize the class of committee scoring rules that satisfy the fixed-majority criterion. In some sense, the committee scoring 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 find that, for most of the rules in our new class, the complexity of winner determination is high (i.e., the problem of computing the winners is NP-hard), but we also show some examples of polynomial-time winner determination procedures, exact and approximate.
UR - http://www.scopus.com/inward/record.url?scp=85007190221&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:85007190221
T3 - 30th AAAI Conference on Artificial Intelligence, AAAI 2016
SP - 482
EP - 488
BT - 30th AAAI Conference on Artificial Intelligence, AAAI 2016
PB - AAAI press
Y2 - 12 February 2016 through 17 February 2016
ER -