Controlling Two-Stage Voting Rules
Guo Jiong, Raj Shrestha Yash · Frontiers in artificial intelligence and applications · 2014
We study the computational complexity of control problems for two-stage voting rules. An example of a two-stage voting rule is the Black's procedure. The first stage of the Black's procedure selects the Condorcet winner if one exists; otherwise, in the second stage the Borda winner is selected. The computational complexity of the manipulation problem of two-stage voting rules has recently been studied by Narodytska and Walsh [20] and Fitzsimmons et al. [14]. Extending their work, we consider the control problems for similar scenarios, focusing on constructive control by adding or deleting votes, denoted as CCAV and CCDV, respectively.