Multigoal Committee Selection

Multigoal Committee Selection

Maciej Kocot, Anna Kolonko, Edith Elkind, Piotr Faliszewski, Nimrod Talmon

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence
Main track. Pages 385-391. https://doi.org/10.24963/ijcai.2019/55

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.
Keywords:
Agent-based and Multi-agent Systems: Voting
Agent-based and Multi-agent Systems: Computational Social Choice