科研之友
微信
新浪微博
Facebook
分享链接
摘要
We study the parameterized complexity of voter control problems in -peaked elections, where is a positive integer. In particular, we focus on the constructive/destructive control by adding/deleting votes for Condorcet, Maximin and Copeland. It is known that in general elections all these problems are NP-hard, except for the destructive control by adding/deleting votes for Condorcet which is polynomial-time solvable. We strengthen these results by showing that, when restricted to -peaked elections where =3,4, the above NP-hard problems not only remain NP-hard but also are W[1]-hard with respect to the number of added/deleted votes.
