ML Anthology

Multiwinner Rules on Paths from K-Borda to Chamberlin-Courant

Piotr Faliszewski, Piotr Skowron, Arkadii Slinko, Nimrod Talmon
IJCAI 2017 pp. 192-198
doi:10.24963/IJCAI.2017/28 /ijcai/2017/faliszewski2017ijcai-multiwinner/

Abstract

The classical multiwinner rules are designed for particular purposes. For example, variants of k-Borda are used to find k best competitors in judging contests while the Chamberlin-Courant rule is used to select a diverse set of k products. These rules represent two extremes of the multiwinner world. At times, however, one might need to find an appropriate trade-off between these two extremes. We explore continuous transitions from k-Borda to Chamberlin-Courant and study intermediate rules.

PDF IJCAI Semantic Scholar

Cite

Text

Faliszewski et al. "Multiwinner Rules on Paths from K-Borda to Chamberlin-Courant." International Joint Conference on Artificial Intelligence, 2017. doi:10.24963/IJCAI.2017/28

Markdown

[Faliszewski et al. "Multiwinner Rules on Paths from K-Borda to Chamberlin-Courant." International Joint Conference on Artificial Intelligence, 2017.](https://mlanthology.org/ijcai/2017/faliszewski2017ijcai-multiwinner/) doi:10.24963/IJCAI.2017/28

BibTeX

@inproceedings{faliszewski2017ijcai-multiwinner,
  title     = {{Multiwinner Rules on Paths from K-Borda to Chamberlin-Courant}},
  author    = {Faliszewski, Piotr and Skowron, Piotr and Slinko, Arkadii and Talmon, Nimrod},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2017},
  pages     = {192-198},
  doi       = {10.24963/IJCAI.2017/28},
  url       = {https://mlanthology.org/ijcai/2017/faliszewski2017ijcai-multiwinner/}
}