Control Complexity of Schulze Voting
Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence. Pages 286-291.
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.
@inproceedings{ijcai2013p51,
title = {Control Complexity of Schulze Voting},
author = {Menton, Curtis Glen and Singh, Preetjot},
booktitle = {Proceedings of the Twenty-Third International Joint Conference on
Artificial Intelligence, {IJCAI-13}},
publisher = {AAAI Press / International Joint Conferences on Artificial Intelligence},
editor = {Francesca Rossi},
pages = {286--291},
year = {2013},
month = {8},
url = {https://ijcai.org/proceedings/2013/51},
}
TY - CPAPER TI - Control Complexity of Schulze Voting AU - Menton, Curtis Glen AU - Singh, Preetjot T2 - Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence, IJCAI-13 PB - AAAI Press / International Joint Conferences on Artificial Intelligence PY - 2013 SP - 286 EP - 291 UR - https://ijcai.org/proceedings/2013/51 ER -Copied
Machine-readable versions of this paper, for tools and AI agents: