Access the full text.
Sign up today, get DeepDyve free for 14 days.
P Faliszewski, E Hemaspaandra, L Hemaspaandra (2011)
Multimode control attacks on electionsJ. Artif. Intell. Res., 40
E Hemaspaandra, L Hemaspaandra, J Rothe (2017)
The complexity of online voter control in sequential electionsJ. Auton. Agents Multi-Agent Syst., 31
C Puppe, A Tasnádi (2009)
Optimal redistricting under geographical constraints: Why “pack and crack” does not workEcon. Lett., 105
J Rothe (2005)
Complexity theory and cryptology. An Introduction to Cryptocomplexity. EATCS Texts in Theoretical Computer Science
N Betzler, B Dorn (2010)
Towards a dichotomy for the possible winner problem in elections based on scoring rulesJ. Comput. Syst. Sci., 76
P Faliszewski, E Hemaspaandra, L Hemaspaandra, J Rothe (2009)
Llull and Copeland voting computationally resist bribery and constructive controlJ. Artif. Intell. Res., 35
R Niedermeier (2006)
Invitation to fixed-parameter algorithms
C Papadimitriou (1995)
Computational Complexity, 2nd edn
C Menton (2013)
Normalized range voting broadly resists controlTheory Comput. Syst., 53
M Garey, D Johnson (1979)
Computers and Intractability: A Guide to the Theory of NP-Completeness
R Downey, M Fellows (2013)
Parameterized Complexity, 2nd edn
E Hemaspaandra, L Hemaspaandra, J Rothe (2009)
Hybrid elections broaden complexity-theoretic resistance to controlMath. Log. Q., 55
E Hemaspaandra, L Hemaspaandra (2007)
Dichotomy for voting systemsJ. Comput. Syst. Sci., 73
D Baumeister, J Rothe (2012)
Taking the final step to a full dichotomy of the possible winner problem in pure scoring rulesInf. Process. Lett., 112
G Erdélyi, M Fellows, J Rothe, L Schend (2015)
Control complexity in Bucklin and fallback voting: A theoretical analysisJ. Comput. Syst. Sci., 81
E Hemaspaandra, L Hemaspaandra, J Rothe (2007)
Anyone but him: The complexity of precluding an alternativeArtif. Intell., 171
E Elkind, P Faliszewski, A Slinko (2011)
Cloning in elections: Finding the possible winnersJ. Artif. Intell. Res., 42
E Hemaspaandra, L Hemaspaandra, J Rothe (2017)
The complexity of controlling candidate-sequential electionsTheor. Comput. Sci., 678
N Betzler, J Uhlmann (2009)
Parameterized complexity of candidate control in elections and related digraph problemsTheor. Comput. Sci., 410
P Faliszewski, E Hemaspaandra, L Hemaspaandra (2009)
How hard is bribery in electionsJ. Artif. Intell. Res., 35
P Faliszewski, E Hemaspaandra, L Hemaspaandra (2015)
Weighted electoral controlJ. Artif. Intell. Res., 52
G Erdélyi, M Nowak, J Rothe (2009)
Sincere-strategy preference-based approval voting fully resists constructive control and broadly resists destructive controlMath. Log. Q., 55
Control by partition refers to situations where an election chair seeks to influence the outcome of an election by partitioning either the candidates or the voters into two groups, thus creating two first-round subelections that determine who will take part in a final round. The model of partition-of-voters control attacks is remotely related to “gerrymandering” (maliciously resizing election districts). While the complexity of control by partition has been studied thoroughly for many voting systems, there are no such results known for the important veto voting system. We settle the complexity of control by partition for veto in a broad variety of models. In addition, by giving a counterexample we observe that a reduction from the literature (Chen et al. 2015) showing the parameterized complexity of control by adding candidates to plurality elections, parameterized by the number of voters, is technically flawed, and we show how this reduction can be adapted to make it correct.
Annals of Mathematics and Artificial Intelligence – Springer Journals
Published: Oct 26, 2017
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.