Control complexity in Bucklin and fallback voting: An experimental analysis☆
Under an Elsevier user license
open archive
Keywords
Computational social choice
Control complexity
Bucklin voting
Fallback voting
Experimental analysis
Election systems
Cited by (0)
- ☆
Preliminary versions of parts of this paper appear in the proceedings of the 11th International Symposium on Experimental Algorithms [31] and the COMSOC special session at the 12th International Symposium on Artificial Intelligence and Mathematics [32], and were presented at the Tenth International Meeting of the Society for Social Choice and Welfare and at the Dagstuhl Seminar “Computation and Incentives in Social Choice” [34].
Copyright © 2014 Elsevier Inc. All rights reserved.