Search versus Decision for Election Manipulation Problems
type: Item
instance of: scholarly article
title: Search versus Decision for Election Manipulation Problems
zbMATH Open document ID: 1499.91039
DOI: 10.1145/3369937
author: Edith Hemaspaandra
author: Lane A. Hemaspaandra
author: Curtis Menton
published in: ACM Transactions on Computation Theory
publication date: 2022-12-05T00:00:00Z
Mathematics Subject Classification ID: 91B14
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 7626540
zbMATH Keywords: structural complexity theory
zbMATH Keywords: Borodin-Demers theorem
zbMATH Keywords: elections
zbMATH Keywords: search versus decision
zbMATH Keywords: typical-case complexity
MaRDI profile type: MaRDI publication profile
full work available at URL: https://doi.org/10.1145/3369937
OpenAlex ID: W2962826019
Wikidata QID: Q130984829
Recommended article: Search versus Decision for Election Manipulation Problems
Recommended article: The computational difficulty of manipulating an election
Recommended article: Hardness and algorithms for electoral manipulation under media influence
Recommended article: Complexity of manipulation with partial information in voting
Recommended article: The complexity of online manipulation of sequential elections
Recommended article: Manipulative elicitation -- a new attack on elections with incomplete preferences
Recommended article: Manipulation in elections with uncertain preferences
Recommended article: Probabilistic view of voting, paradoxes, and manipulation
Recommended article: Voting in the full-information best-choice problem
Recommended article: Dichotomy for Pure Scoring Rules Under Manipulative Electoral Actions
description: scientific article; zbMATH DE number 7626540