Committee Scoring Rules: Axiomatic Classification and Hierarchy
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence. Pages 250-255.
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.
@inproceedings{ijcai2016p43,
title = {Committee Scoring Rules: Axiomatic Classification and Hierarchy},
author = {Faliszewski, Piotr and Skowron, Piotr Krzysztof and Slinko, Arkadii M. and Talmon, Nimrod},
booktitle = {Proceedings of the Twenty-Fifth International Joint Conference on
Artificial Intelligence, {IJCAI-16}},
publisher = {AAAI Press / International Joint Conferences on Artificial Intelligence},
editor = {Subbarao Kambhampati},
pages = {250--255},
year = {2016},
month = {7},
url = {https://ijcai.org/proceedings/2016/43},
}
TY - CPAPER TI - Committee Scoring Rules: Axiomatic Classification and Hierarchy AU - Faliszewski, Piotr AU - Skowron, Piotr Krzysztof AU - Slinko, Arkadii M. AU - Talmon, Nimrod T2 - Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI-16 PB - AAAI Press / International Joint Conferences on Artificial Intelligence PY - 2016 SP - 250 EP - 255 UR - https://ijcai.org/proceedings/2016/43 ER -Copied
Machine-readable versions of this paper, for tools and AI agents: