Parameterized complexity of voter control in multi-peaked elections

DOI10.1007/S00224-018-9843-8zbMATH Open1422.91227OpenAlexW2788181108MaRDI QIDQ2322697FDOQ2322697

Jiong Guo, Yongjie Yang

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

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

zbMATH Keywords

parameterized complexityCondorcetelection controlCopelandMaximinmulti-peaked electionsingle-peaked election

Mathematics Subject Classification ID

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

Cites Work

• Fundamentals of parameterized complexity
• Efficient algorithms for interval graphs and circular-arc graphs
• Single-peaked orders on a tree
• On the parameterized complexity of multiple-interval graph problems
• Anyone but him: the complexity of precluding an alternative
• Parameterized computational complexity of control problems in voting systems
• How hard is it to control an election?
• Combinatorial voter control in elections
• Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates
• Multimode Control Attacks on Elections
• Llull and Copeland Voting Computationally Resist Bribery and Constructive Control
• The complexity of manipulative attacks in nearly single-peaked electorates
• Control and Bribery in Voting
• The shield that never was: societies with single-peaked preferences are more open to manipulation and control
• Parameterized complexity of control problems in Maximin election
• On the computation of fully proportional representation
• Are there any nicely structured preference profiles nearby?
• Sincere-Strategy Preference-Based Approval Voting Fully Resists Constructive Control and Broadly Resists Destructive Control
• 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
• A characterization of the single-peaked domain
• A Polynomial Time Algorithm for Unidimensional Unfolding Representations
• More Natural Models of Electoral Control by Partition
• Computational Aspects of Nearly Single-Peaked Electorates
• The control complexity of \(r\)-Approval: from the single-peaked case to the general case

Cited In (4)

• 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
• Title not available (Why is that?)
• 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)