Search versus Decision for Election Manipulation Problems

DOI10.1145/3369937MaRDI QIDQ5053055zbMATH OpenOpenAlexWikidataFDO

Authors Edith Hemaspaandra, Lane A. Hemaspaandra, Curtis Menton

Publication date 5 December 2022

Published in ACM Transactions on Computation Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3369937

zbMATH Keywords

electionsstructural complexity theorytypical-case complexityBorodin-Demers theoremsearch versus decision

Mathematics Subject Classification ID

Social choice (91B14) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Search versus decision for election manipulation problems
• The computational difficulty of manipulating an election
• Hardness and algorithms for electoral manipulation under media influence
• Complexity of manipulation with partial information in voting
• The complexity of online manipulation of sequential elections
• Manipulative elicitation -- a new attack on elections with incomplete preferences
• Manipulation in elections with uncertain preferences
• Probabilistic view of voting, paradoxes, and manipulation
• Voting in the full-information best-choice problem
• Dichotomy for pure scoring rules under manipulative electoral actions

Cited in

(5)

• Control complexity in Borda elections: solving all open cases of offline control and some cases of online control
• The opacity of backbones
• Hardness and algorithms for electoral manipulation under media influence
• The computational difficulty of manipulating an election
• Search versus decision for election manipulation problems

This page was built for publication: Search versus Decision for Election Manipulation Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5053055)