Parameterized Complexity of Control in Amendment and Successive Voting Procedures
A comprehensive parameterized-complexity classification of constructive and destructive election control -- by adding or deleting voters or candidates -- under the amendment and successive agenda-based sequential-majority voting procedures (and a generalized amendment procedure). Determines, across numerous parameters, which control problems are fixed-parameter tractable and which are W-hard or para-NP-hard, thereby quantifying how strongly each procedure resists strategic manipulation of the electorate or candidate set.
On the Parameterized Complexity of Controlling Amendment and Successive Winners* Yongjie Yang
Computational-social-choice research paper mapping the parameterized complexity of election control under the amendment and successive voting procedures, two agenda-based sequential-majority methods …