{"type":"ScholarlyArticle","title":"Committee Scoring Rules: Axiomatic Classification and Hierarchy","authors":[{"name":"Piotr Faliszewski","slug":"piotr-faliszewski","given":"Piotr","family":"Faliszewski","affiliation":""},{"name":"Piotr Krzysztof Skowron","slug":"piotr-krzysztof-skowron","given":"Piotr Krzysztof","family":"Skowron","affiliation":""},{"name":"Arkadii M. Slinko","slug":"arkadii-m-slinko","given":"Arkadii M.","family":"Slinko","affiliation":""},{"name":"Nimrod Talmon","slug":"nimrod-talmon","given":"Nimrod","family":"Talmon","affiliation":""}],"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.","doi":null,"url":"https://ijcai.org/proceedings/2016/43","pdf":"https://ijcai.org/proceedings/2016/0043.pdf","markdown":"https://ijcai.org/proceedings/2016/43.md","bibtex":"https://ijcai.org/proceedings/2016/bibtex/43","volume":{"slug":"2016","title":"Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2016","url":"https://ijcai.org/proceedings/2016/","year":2016,"location":"New York, NY, USA","dates":"9–15 July 2016","editors":"Subbarao Kambhampati","isbn":"978-1-57735-770-4; 978-1-57735-771-1","publisher":"AAAI Press / International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":43,"pages":{"first":250,"last":255},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}