Weighted Electoral Control

DOI10.1613/jair.4621zbMath1328.91068arXiv1305.0943OpenAlexW2160688873MaRDI QIDQ5246710

Piotr Faliszewski, Hemaspaandra, Lane A., Edith Hemaspaandra

Publication date: 22 April 2015

Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1305.0943

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Voting theory (91B12) History, political science (91F10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (10)

Schulze and ranked-pairs voting are fixed-parameter tractable to bribe, manipulate, and control ⋮ The complexity of priced control in elections ⋮ Optimal defense against election control by deleting voter groups ⋮ On the Computational Complexity of Variants of Combinatorial Voter Control in Elections ⋮ Control complexity in Borda elections: solving all open cases of offline control and some cases of online control ⋮ Campaign management under approval-driven voting rules ⋮ Complexity of control by partitioning veto elections and of control by adding candidates to plurality elections ⋮ A parameterized perspective on protecting elections ⋮ Computational complexity characterization of protecting elections from bribery ⋮ Mixed integer programming with convex/concave constraints: fixed-parameter tractability and applications to multicovering and voting

This page was built for publication: Weighted Electoral Control