Committee scoring rules: Axiomatic classification and hierarchy

Piotr Faliszewski, Piotr Skowron, Arkadii Slinko, Nimrod Talmon

Research output: Contribution to journalConference articlepeer-review

30 Scopus citations


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.

Original languageEnglish
Pages (from-to)250-256
Number of pages7
JournalIJCAI International Joint Conference on Artificial Intelligence
StatePublished - 1 Jan 2016
Externally publishedYes
Event25th International Joint Conference on Artificial Intelligence, IJCAI 2016 - New York, United States
Duration: 9 Jul 201615 Jul 2016

ASJC Scopus subject areas

  • Artificial Intelligence

Cite this