资源分类
》 资源 》论文》Committee Scoring Rules: Axiomatic Classification and Hierarchy

Committee Scoring Rules: Axiomatic Classification and Hierarchy

2019-11-22 | |  52 |   38 |   0
Abstract We consider several natural classes of committee scoring rules, namely, weakly separable, representation-focused, top-k-counting, OWAbased, 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.

上一篇：Voting-Based Group Formation

下一篇：How Hard Is It for a Party to Nominate an Election Winner?

用户评价
全部评价

热门资源

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...