Control complexity in Bucklin and fallback voting: An experimental analysis ?
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.
control complexity fallback voting experimental analysis computational social choice bucklin voting election systems