ML Anthology

Committee Scoring Rules: Axiomatic Classification and Hierarchy

Piotr Faliszewski, Piotr Skowron, Arkadii Slinko, Nimrod Talmon
IJCAI 2016 pp. 250-256
/ijcai/2016/faliszewski2016ijcai-committee/

Abstract

We consider several natural classes of committee scoring rules, namely, weakly separable, representation-focused, top-k-counting, OWA-based, and decomposable rules. We study some of their axiomatic properties, especially properties of monotonicity, and concentrate on containment relations between them. We characterize SNTV, Bloc, and k-approval Chamberlin-Courant, as the only rules in certain intersections of these classes. We introduce decomposable rules, describe some of their applications, and show that the class of decomposable rules strictly contains the class of OWA-based rules. PDF

PDF IJCAI Semantic Scholar

Cite

Text

Faliszewski et al. "Committee Scoring Rules: Axiomatic Classification and Hierarchy." International Joint Conference on Artificial Intelligence, 2016.

Markdown

[Faliszewski et al. "Committee Scoring Rules: Axiomatic Classification and Hierarchy." International Joint Conference on Artificial Intelligence, 2016.](https://mlanthology.org/ijcai/2016/faliszewski2016ijcai-committee/)

BibTeX

@inproceedings{faliszewski2016ijcai-committee,
  title     = {{Committee Scoring Rules: Axiomatic Classification and Hierarchy}},
  author    = {Faliszewski, Piotr and Skowron, Piotr and Slinko, Arkadii and Talmon, Nimrod},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2016},
  pages     = {250-256},
  url       = {https://mlanthology.org/ijcai/2016/faliszewski2016ijcai-committee/}
}