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.
|Number of pages||7|
|Journal||IJCAI International Joint Conference on Artificial Intelligence|
|State||Published - 1 Jan 2016|
|Event||25th International Joint Conference on Artificial Intelligence, IJCAI 2016 - New York, United States|
Duration: 9 Jul 2016 → 15 Jul 2016
ASJC Scopus subject areas
- Artificial Intelligence