Control complexity in Bucklin and fallback voting: A theoretical analysis
Control complexity in Bucklin and fallback voting: A theoretical analysis
复制标题
DOI：
10.1016/j.jcss.2014.11.002
复制
发表时间：
2015-06
期刊：
影响因子：
--
通讯作者：
G. Erdélyi;M. Fellows;J. Rothe;Lena Schend
中科院分区：
文献类型：
--
作者：
G. Erdélyi;M. Fellows;J. Rothe;Lena Schend
选举控制模型通过添加、删除或划分候选人或选民等操作来改变选举结果。为了保护选举免受这种控制企图的影响，计算复杂性被用来建立所谓的抵抗结果。我们发现，回退投票，由Brams和Sanver [12]提出的联合收割机Bucklin与批准投票相结合的选举系统，显示了目前已知的最广泛的控制阻力，在自然选举系统中具有多项式时间赢家问题。我们还研究了Bucklin投票的控制复杂性，并表明它在控制阻力方面几乎与回退投票一样好。此外，我们调查的参数化控制的复杂性Bucklin和回退投票，根据几个参数，往往是很可能是小的典型实例。在一篇配套论文[28]中，我们从实验的角度挑战了我们的最坏情况复杂度结果。
Electoral control models ways of changing the outcome of an election via such actions as adding, deleting, or partitioning either candidates or voters. To protect elections from such control attempts, computational complexity has been used to establish so-calledresistanceresults. We show that fallback voting, an election system proposed by Brams and Sanver [12] to combine Bucklin with approval voting, displays the broadest control resistance currently known to hold among natural election systems with a polynomial-time winner problem. We also study the control complexity of Bucklin voting and show that it performs almost as well as fallback voting in terms of control resistance. Furthermore, we investigate the parameterized control complexity of Bucklin and fallback voting, according to several parameters that are often likely to be small for typical instances. In a companion paper [28], we challenge our worst-case complexity results from an experimental point of view.