资源分类
》 资源 》论文》Control Complexity of Schulze Voting Curtis Menton1 and Preetjot Singh2

Control Complexity of Schulze Voting Curtis Menton1 and Preetjot Singh2

2019-11-11 | |  70 |   38 |   0
Abstract Schulze voting is a recently introduced voting system enjoying unusual popularity and a high degree of real-world use, with users including the Wikimedia foundation, several branches of the Pirate Party, and MTV. It is a Condorcet voting system that determines the winners of an election using information about paths in a graph representation of the election. We resolve the complexity of many electoral control cases for Schulze voting. We find that it falls short of the best known voting systems in terms of control resistance, demonstrating vulnerabilities of concern to some prospective users of the system.

上一篇：Multi-Agent Team Formation: Diversity Beats Strength

下一篇：Computational Analysis of Connectivity Games with Applications to the Investigation of Terrorist Networks

用户评价
全部评价

热门资源

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • A Mathematical Mo...

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

  • Rating-Boosted La...

    The performance of a recommendation system reli...