Control complexity in Bucklin and fallback voting: An experimental analysis
作者：
Highlights：
• Electoral control models ways of changing the outcome of an election via adding, deleting, or partitioning candidates or voters.
• We tackle NP-hard control problems for Bucklin and fallback elections in an experimental setting.
• While NP-hard manipulation problems have been challenged experimentally, this is the first such study for electoral control.
• Our experiments allow a more fine-grained analysis and comparison of the computational hardness of control problems.
摘要
•Electoral control models ways of changing the outcome of an election via adding, deleting, or partitioning candidates or voters.•We tackle NP-hard control problems for Bucklin and fallback elections in an experimental setting.•While NP-hard manipulation problems have been challenged experimentally, this is the first such study for electoral control.•Our experiments allow a more fine-grained analysis and comparison of the computational hardness of control problems.
论文关键词：Computational social choice,Control complexity,Bucklin voting,Fallback voting,Experimental analysis,Election systems
论文评审过程：Received 14 December 2012, Revised 30 April 2014, Accepted 5 September 2014, Available online 18 November 2014.
论文官网地址：https://doi.org/10.1016/j.jcss.2014.11.003
