Multigoal Committee Selection

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

IJCAI 2019 pp. 385-391

doi:10.24963/IJCAI.2019/55 /ijcai/2019/kocot2019ijcai-multigoal/

Abstract

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.

PDF IJCAI Semantic Scholar

Cite

Text

Kocot et al. "Multigoal Committee Selection." International Joint Conference on Artificial Intelligence, 2019. doi:10.24963/IJCAI.2019/55

Markdown

[Kocot et al. "Multigoal Committee Selection." International Joint Conference on Artificial Intelligence, 2019.](https://mlanthology.org/ijcai/2019/kocot2019ijcai-multigoal/) doi:10.24963/IJCAI.2019/55

BibTeX

@inproceedings{kocot2019ijcai-multigoal,
  title     = {{Multigoal Committee Selection}},
  author    = {Kocot, Maciej and Kolonko, Anna and Elkind, Edith and Faliszewski, Piotr and Talmon, Nimrod},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2019},
  pages     = {385-391},
  doi       = {10.24963/IJCAI.2019/55},
  url       = {https://mlanthology.org/ijcai/2019/kocot2019ijcai-multigoal/}
}