资源分类
》 资源 》论文》The Complexity of Manipulative Attacks in Nearly Single-Peaked Electorates (Extended Abstract)?

The Complexity of Manipulative Attacks in Nearly Single-Peaked Electorates (Extended Abstract)?

2019-11-20 | |  63 |   40 |   0
Abstract Many electoral control and manipulation problems—which we will refer to in general as “manipulative actions” problems—are NP-hard in the general case. Many of these problems fall into polynomial time if the electorate is singlepeaked, i.e., is polarized along some axis/issue. However, real-world electorates are not truly single-peaked—for example, there may be some maverick voters—and to take this into account, we study the complexity of manipulative-action algorithms for the case of nearly single-peaked electorates.

上一篇：Common Sense Reasoning for Detection, Prevention, and Mitigation of Cyberbullying (Extended Abstract)

下一篇：Measuring and Recommending Time-Sensitive Routes from Location-Based Data Extended Abstract

用户评价
全部评价

热门资源

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to learn...

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

  • A Mathematical Mo...

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

  • Learning to Predi...

    Much of model-based reinforcement learning invo...