资源分类
》 资源 》论文》How Hard Is It for a Party to Nominate an Election Winner?

How Hard Is It for a Party to Nominate an Election Winner?

2019-11-22 | |  41 |   36 |   0
Abstract We consider a Plurality-voting scenario, where the candidates are split between parties, and each party nominates exactly one candidate for the final election. We study the computational complexity of deciding if there is a set of nominees such that a candidate from a given party wins in the final election. In our second problem, the goal is to decide if a candidate from a given party always wins, irrespective who is nominated. We show that these problems are computationally hard, but are polynomial-time solvable for restricted settings.

上一篇：Committee Scoring Rules: Axiomatic Classification and Hierarchy

下一篇：Parallel Behavior Composition for Manufacturing

用户评价
全部评价

热门资源

  • 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...