TY - GEN
T1 - Multigoal committee selection
AU - Kocot, Maciej
AU - Kolonko, Anna
AU - Elkind, Edith
AU - Faliszewski, Piotr
AU - Talmon, Nimrod
N1 - Publisher Copyright:
© 2019 International Joint Conferences on Artificial Intelligence. All rights reserved.
PY - 2019/1/1
Y1 - 2019/1/1
N2 - We study the problem of computing committees that perform well according to several different criteria, which are expressed as committee scoring rules. We analyze the computational complexity of computing such committees and provide an experimental evaluation of the compromise levels that can be achieved between several well-known rules, including k-Borda, SNTV, Bloc, and the Chamberlin-Courant rule.
AB - We study the problem of computing committees that perform well according to several different criteria, which are expressed as committee scoring rules. We analyze the computational complexity of computing such committees and provide an experimental evaluation of the compromise levels that can be achieved between several well-known rules, including k-Borda, SNTV, Bloc, and the Chamberlin-Courant rule.
UR - http://www.scopus.com/inward/record.url?scp=85074926891&partnerID=8YFLogxK
U2 - 10.24963/ijcai.2019/55
DO - 10.24963/ijcai.2019/55
M3 - Conference contribution
AN - SCOPUS:85074926891
T3 - IJCAI International Joint Conference on Artificial Intelligence
SP - 385
EP - 391
BT - Proceedings of the 28th International Joint Conference on Artificial Intelligence, IJCAI 2019
A2 - Kraus, Sarit
PB - International Joint Conferences on Artificial Intelligence
T2 - 28th International Joint Conference on Artificial Intelligence, IJCAI 2019
Y2 - 10 August 2019 through 16 August 2019
ER -