Control Complexity of Schulze Voting

摘要：

　　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.

作者: Curtis Menton Preetjot Singh

作者单位: Dept. of Comp. Sci.,University of Rochester,Rochester,NY,USA EECS,Northwestern University,Evanston,IL,USA

会议类型: 国际会议

会议名称: 2013年第23届人工智能国际会议(IJCAI-2013)

会议地点: 北京

会议语种:英文

页码: 286-292

在线出版日期: 2013-08-01（万方平台首次上网日期，不代表论文的发表时间）