Parameterized computational complexity of control problems in voting systems
type: Item
instance of: scholarly article
title: Parameterized computational complexity of control problems in voting systems
zbMATH Open document ID: 1164.91004
author: Hong Liu
author: Haodi Feng
author: Daming Zhu
author: Junfeng Luan
published in: Theoretical Computer Science
publication date: 2009-07-10T00:00:00Z
Mathematics Subject Classification ID: 91B12
zbMATH DE Number: 5577384
zbMATH Keywords: voting systems
zbMATH Keywords: constructive control
zbMATH Keywords: destructive control
zbMATH Keywords: plurality voting
zbMATH Keywords: Condorcet voting
zbMATH Keywords: approval voting
zbMATH Keywords: parameterized complexity
MaRDI profile type: Publication
full work available at URL: j.tcs.2009.04.004
OpenAlex ID: W1990416099
cites work: The computational difficulty of manipulating an election
cites work: How hard is it to control an election?
cites work: Parameterized Complexity of Candidate Control in Elections and Related Digraph Problems
cites work: Handbook of social choice and welfare. Vol. 1.
cites work: Perfect Code is \(W[1]\)-complete
cites work: When are elections with few candidates hard to manipulate?
cites work: Q4393480
cites work: Sincere-Strategy Preference-Based Approval Voting Fully Resists Constructive Control and Broadly Resists Destructive 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: Parametrized complexity theory.
cites work: Q4368728
cites work: Anyone but him: the complexity of precluding an alternative
cites work: Q3624161
cites work: Q5710169
DOI: 10.1016/J.TCS.2009.04.004
description: scientific article; zbMATH DE number 5577384