标题：Parameterized Complexity of Voter Control in Multi-Peaked Elections
作者：Yang, Yongjie; Guo, Jiong
作者机构：[Yang, Yongjie] Cent S Univ, Sch Informat Sci & Engn, Changsha, Hunan, Peoples R China.; [Guo, Jiong] Shandong Univ, Sch Comp Sci & Technol, Jinan, 更多
通讯作者：Yang, YJ;Yang, Yongjie
通讯作者地址：[Yang, YJ]Cent S Univ, Sch Informat Sci & Engn, Changsha, Hunan, Peoples R China.
来源：THEORY OF COMPUTING SYSTEMS
关键词：Condorcet; Copeland; Election control; Maximin; Multi-peaked election; Parameterized complexity; Single-peaked election
摘要：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-hard with respect to the number of added/deleted votes.