Search versus Decision for Election Manipulation Problems

DOI10.1145/3369937zbMath1499.91039OpenAlexW2962826019MaRDI QIDQ5053055

Edith Hemaspaandra, Hemaspaandra, Lane A., 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

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

Related Items (2)

Control complexity in Borda elections: solving all open cases of offline control and some cases of online control ⋮ The opacity of backbones

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