Parameterized complexity of voter control in multi-peaked elections

DOI10.1007/S00224-018-9843-8MaRDI QIDQ2322697zbMATH OpenOpenAlexFDO

Authors Yongjie Yang, Jiong Guo

Publication date 5 September 2019

Published in Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00224-018-9843-8

zbMATH Keywords

parameterized complexityCondorcetelection controlCopelandMaximinmulti-peaked electionsingle-peaked election

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Voting theory (91B12)

Recommendations

• The control complexity of \(r\)-Approval: from the single-peaked case to the general case
• On the complexity of constructive control under nearly single-peaked preferences
• Parameterized complexity of control problems in Maximin election
• Parameterized complexity of control by voter selection in Maximin, Copeland, Borda, Bucklin, and Approval election systems
• Parameterized computational complexity of control problems in voting systems

Cites work

• A Polynomial Time Algorithm for Unidimensional Unfolding Representations
• A characterization of the single-peaked domain
• Anyone but him: the complexity of precluding an alternative
• Are there any nicely structured preference profiles nearby?
• Bypassing combinatorial protections: polynomial-time algorithms for single-peaked electorates
• Combinatorial voter control in elections
• Computational aspects of nearly single-peaked electorates
• Control and bribery in voting
• Efficient algorithms for interval graphs and circular-arc graphs
• Fundamentals of parameterized complexity
• How hard is it to control an election?
• Llull and Copeland Voting Computationally Resist Bribery and Constructive Control
• More natural models of electoral control by partition
• Multimode control attacks on elections
• On the computation of fully proportional representation
• On the parameterized complexity of multiple-interval graph problems
• Parameterized complexity of candidate control in elections and related digraph problems
• Parameterized complexity of control by voter selection in Maximin, Copeland, Borda, Bucklin, and Approval election systems
• Parameterized complexity of control problems in Maximin election
• Parameterized computational complexity of control problems in voting systems
• Sincere-Strategy Preference-Based Approval Voting Fully Resists Constructive Control and Broadly Resists Destructive Control
• Single-peaked orders on a tree
• The complexity of manipulative attacks in nearly single-peaked electorates
• The control complexity of \(r\)-Approval: from the single-peaked case to the general case
• The shield that never was: societies with single-peaked preferences are more open to manipulation and control

Cited in

(8)

• Parameterized complexity of control by voter selection in Maximin, Copeland, Borda, Bucklin, and Approval election systems
• The control complexity of \(r\)-Approval: from the single-peaked case to the general case
• Parameterized Computational Complexity of Dodgson and Young Elections
• The Last Voting Rule Is Home: Complexity of Control by Partition of Candidates or Voters in Maximin Elections
• scientific article; zbMATH DE number 6928629 (Why is no real title available?)
• On the parameterized complexity of party nominations
• On the complexity of constructive control under nearly single-peaked preferences
• Structured preferences: a literature survey

This page was built for publication: Parameterized complexity of voter control in multi-peaked elections

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