Parameterized complexity of candidate control in elections and related digraph problems
type: Item
instance of: scholarly article
title: Parameterized complexity of candidate control in elections and related digraph problems
zbMATH Open document ID: 1176.68138
author: Nadja Betzler
author: Johannes Uhlmann
published in: Theoretical Computer Science
publication date: 2009-11-25T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 91B12
zbMATH DE Number: 5638320
zbMATH Keywords: computational social choice
zbMATH Keywords: digraph modification problems
zbMATH Keywords: \(W\)[1]-/\(W\)[2]-hardness
zbMATH Keywords: NP-hardness
zbMATH Keywords: Copeland\(^\alpha \) voting
zbMATH Keywords: plurality voting
MaRDI profile type: Publication
full work available at URL: j.tcs.2009.05.029
OpenAlex ID: W2077594988
cites work: Digraphs
cites work: The computational difficulty of manipulating an election
cites work: How hard is it to control an election?
cites work: Fixed-Parameter Algorithms for Kemeny Scores
cites work: Parameterized Computational Complexity of Dodgson and Young Elections
cites work: A Short Introduction to Computational Social Choice
cites work: On complexity of lobbying in multiple referenda
cites work: When are elections with few candidates hard to manipulate?
cites work: Threshold dominating sets and an improved characterization of \(W[2]\)
cites work: Q4393480
cites work: On Approximating Optimal Weighted Lobbying, and Frequency of Correctness Versus Average-Case Polynomial Time
cites work: Sincere-Strategy Preference-Based Approval Voting Broadly Resists Control
cites work: How Hard Is Bribery in Elections?
cites work: Llull and Copeland Voting Computationally Resist Bribery and Constructive Control
cites work: Copeland Voting Fully Resists Constructive Control
cites work: A Richer Understanding of the Complexity of Election Systems
cites work: Parametrized complexity theory.
cites work: Q4198056
cites work: Anyone but him: the complexity of precluding an alternative
cites work: Graphs, networks and algorithms
cites work: Q3624161
cites work: Q5710169
cites work: Q3624050
cites work: Algorithms for the coalitional manipulation problem
DOI: 10.1016/J.TCS.2009.05.029
description: scientific article; zbMATH DE number 5638320