资源分类
》 资源 》论文》Voting by Sequential Elimination with few Voters

Voting by Sequential Elimination with few Voters

2019-10-29 | |  40 |   33 |   0
Abstract We define a new class of low-communication voting rules, tailored for contexts with few voters and possibly many candidates. These rules are defined by a predefined sequence of voters: at each stage, the designated voter eliminates a candidate, and the last remaining candidate wins. We study deterministic and randomized versions of these rules. We first investigate their axiomatic properties. Then we focus on a subfamily of rules defined by “noninterleaved” sequences, for which we seek a sequence that best approximates the Borda rule under Impartial Culture. Finally, we apply our rules to randomly generated data

上一篇：Verification of Broadcasting Multi-Agent Systems against an Epistemic Strategy Logic

下一篇：A General Multi-agent Epistemic Planner Based on Higher-order Belief Change

用户评价
全部评价

热门资源

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Learning to learn...

    The move from hand-designed features to learned...

  • A Mathematical Mo...

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