Parameterized Complexity of Candidate Control in Elections and Related Digraph Problems
There are different ways for an external agent to influence the outcome of an election. We concentrate on “control” by adding or deleting candidates of an election. Our main focus is to investigate the parameterized complexity of various control problems for different voting systems. To this end, we introduce natural digraph problems that may be of independent interest. They help in determining the parameterized complexity of control for different voting systems including Llull, Copeland, and plurality votings. Devising several parameterized reductions, we provide a parameterized complexity overview of the digraph and control problems with respect to natural parameters.
KeywordsParameterized Complexity Vote System Preference List Parameterized Reduction Candidate Control
Unable to display preview. Download preview PDF.
- 5.Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)Google Scholar
- 6.Faliszewski, P., Hemaspaandra, E., Hemaspaandra, L.A., Rothe, J.: Llull and Copeland voting broadly resist bribery and control. In: Proc. of 22nd AAAI 2007, pp. 724–730 (2007)Google Scholar
- 7.Faliszewski, P., Hemaspaandra, E., Hemaspaandra, L.A., Rothe, J.: Copeland voting fully resists constructive control. In: Proc. of 4th AAIM 2008 (2008)Google Scholar