On the complexity of bribery with distance restrictions

DOI10.1016/j.tcs.2018.08.013zbMath1417.91190OpenAlexW2886696574WikidataQ129386833 ScholiaQ129386833MaRDI QIDQ1713407

Jiong Guo, Yongjie Yang, Yash Raj Shrestha

Publication date: 25 January 2019

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2018.08.013

zbMATH Keywords

complexityvotingbriberyswap distancedistance restriction

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Control of Condorcet voting: complexity and a relation-algebraic approach
• The complexity of manipulative attacks in nearly single-peaked electorates
• The shield that never was: societies with single-peaked preferences are more open to manipulation and control
• Clustering to minimize the maximum intercluster distance
• Voting schemes for which it can be difficult to tell who won the election
• The control complexity of \(r\)-Approval: from the single-peaked case to the general case
• Bribery in voting with CP-nets
• Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates
• Multimode Control Attacks on Elections
• Swap Bribery
• Llull and Copeland Voting Computationally Resist Bribery and Constructive Control
• How Hard Is Bribery in Elections?
• Exact analysis of Dodgson elections
• Comparing Top k Lists
• How Hard Is Bribery with Distance Restrictions
• Control and Bribery in Voting
• A NEW MEASURE OF RANK CORRELATION

This page was built for publication: On the complexity of bribery with distance restrictions