Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bartholdi III, J.J., Tovey, C.A., Trick, M.A.: How hard is it to control an election. Mathematical and Computer Modelling 16(8-9), 27–40 (1992)
Christian, R., Fellows, M.R., Rosamond, F.A., Slinko, A.M.: On complexity of lobbying in multiple referenda. Review of Economic Design 11(3), 217–224 (2007)
Conitzer, V., Sandholm, T., Lang, J.: When are elections with few candidates hard to manipulate? Journal of the ACM 54(3), 1–33 (2007)
Downey, R.G., Fellows, M.R.: Threshold dominating sets and an improved version of W[2]. Theoretical Computer Science 209, 123–140 (1998)
Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)
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)
Faliszewski, P., Hemaspaandra, E., Hemaspaandra, L.A., Rothe, J.: Copeland voting fully resists constructive control. In: Proc. of 4th AAIM 2008 (2008)
Hemaspaandra, E., Hemaspaandra, L.A., Rothe, J.: Anyone but him: The complexity of precluding an alternative. Artificial Intelligence 171, 255–285 (2007)
König, D.: Über Graphen und ihre Anwendungen auf Determinantentheorie und Mengenlehre. Mathematische Annalen 77, 453–465 (1916)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Betzler, N., Uhlmann, J. (2008). Parameterized Complexity of Candidate Control in Elections and Related Digraph Problems. In: Yang, B., Du, DZ., Wang, C.A. (eds) Combinatorial Optimization and Applications. COCOA 2008. Lecture Notes in Computer Science, vol 5165. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85097-7_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-85097-7_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85096-0
Online ISBN: 978-3-540-85097-7
eBook Packages: Computer ScienceComputer Science (R0)