Anyone but him: the complexity of precluding an alternative
type: Item
instance of: scholarly article
title: Anyone but him: the complexity of precluding an alternative
zbMATH Open document ID: 1168.91346
author: Edith Hemaspaandra
author: Jörg Rothe
author: Lane A. Hemaspaandra
published in: Artificial Intelligence
publication date: 2009-07-09T00:00:00Z
Mathematics Subject Classification ID: 91B12
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68T01
zbMATH DE Number: 5576666
zbMATH Keywords: approval voting
zbMATH Keywords: computational complexity
zbMATH Keywords: computational resistance
zbMATH Keywords: Condorcet voting
zbMATH Keywords: destructive control
zbMATH Keywords: election systems
zbMATH Keywords: plurality voting
zbMATH Keywords: preference aggregation
zbMATH Keywords: multiagent systems
zbMATH Keywords: vote suppression
MaRDI profile type: Publication
full work available at URL: j.artint.2007.01.005
OpenAlex ID: W2570387407
cites work: Single transferable vote resists strategic voting
cites work: The computational difficulty of manipulating an election
cites work: How hard is it to control an election?
cites work: Q3266133
cites work: Q3323629
cites work: Handbook of social choice and welfare. Vol. 1.
cites work: When are elections with few candidates hard to manipulate?
cites work: How Hard Is Bribery in Elections?
cites work: A Richer Understanding of the Complexity of Election Systems
cites work: Q4198056
cites work: Q4536344
cites work: Dichotomy for voting systems
cites work: Exact analysis of Dodgson elections
cites work: Hybrid Elections Broaden Complexity-Theoretic Resistance to Control
cites work: The complexity of Kemeny elections
cites work: Q3862379
cites work: A comparison of polynomial time reducibilities
cites work: Q3624161
cites work: Exact complexity of the winner problem for Young elections
cites work: Q4472458
cites work: Q4681553
DOI: 10.1016/J.ARTINT.2007.01.005
description: scientific article; zbMATH DE number 5576666