On the Complexity of Controlling Amendment and Successive Winners

Successive and amendment are two important sequential voting procedures widely used in parliamentary and legislative decision making. They have been extensively studied in the literature from different perspectives. However, investigating them through the lens of computational complexity theory has not been well conducted heretofore. This paper studies the parameterized complexity of constructive/destructive control by adding/deleting voters/candidates for these two procedures and provides a comprehensive parameterized complexity landscape of these problems.