Search versus Decision for Election Manipulation Problems
From MaRDI portal
Publication:2957899
DOI10.4230/LIPIcs.STACS.2013.377zbMath1354.91054arXiv1202.6641OpenAlexW3126731212MaRDI QIDQ2957899
Curtis Menton, Edith Hemaspaandra, Hemaspaandra, Lane A.
Publication date: 30 January 2017
Full work available at URL: https://arxiv.org/abs/1202.6641
Related Items (13)
Manipulation complexity of same-system runoff elections ⋮ Schulze and ranked-pairs voting are fixed-parameter tractable to bribe, manipulate, and control ⋮ The complexity of priced control in elections ⋮ Complexity of control in judgment aggregation for uniform premise-based quota rules ⋮ Complexity of manipulation and bribery in judgment aggregation for uniform premise-based quota rules ⋮ Challenges to complexity shields that are supposed to protect elections against manipulation and control: a survey ⋮ Pseudo-deterministic Proofs ⋮ The Complexity Landscape of Outcome Determination in Judgment Aggregation ⋮ The Power of Self-Reducibility: Selectivity, Information, and Approximation ⋮ The complexity of manipulative attacks in nearly single-peaked electorates ⋮ Control complexity in Bucklin and fallback voting: a theoretical analysis ⋮ Control complexity in Bucklin and fallback voting: an experimental analysis ⋮ Complexity of control by partitioning veto elections and of control by adding candidates to plurality elections
This page was built for publication: Search versus Decision for Election Manipulation Problems
