The shield that never was: societies with single-peaked preferences are more open to manipulation and control
From MaRDI portal
Publication:627120
DOI10.1016/j.ic.2010.09.001zbMath1218.91042OpenAlexW1983312130MaRDI QIDQ627120
Jörg Rothe, Piotr Faliszewski, Edith Hemaspaandra, Hemaspaandra, Lane A.
Publication date: 21 February 2011
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2010.09.001
algorithmsmultiagent systemscomplexity theorycomputational social choicepreference aggregationcontrol and manipulation of elections
Related Items (27)
Are there any nicely structured preference profiles nearby? ⋮ The complexity of priced control in elections ⋮ Optimal defense against election control by deleting voter groups ⋮ The control complexity of \(r\)-Approval: from the single-peaked case to the general case ⋮ A characterization of the single-peaked single-crossing domain ⋮ Normalized range voting broadly resists control ⋮ Group control for consent rules with consecutive qualifications ⋮ The shield that never was: societies with single-peaked preferences are more open to manipulation and control ⋮ Complexity of manipulation and bribery in premise-based judgment aggregation with simple formulas ⋮ Resilient heuristic aggregation of judgments in the pairwise comparisons method ⋮ Structure of single-peaked preferences ⋮ On the likelihood of single-peaked preferences ⋮ Challenges to complexity shields that are supposed to protect elections against manipulation and control: a survey ⋮ Unnamed Item ⋮ On the complexity of bribery with distance restrictions ⋮ Towards a dichotomy for the possible winner problem in elections based on scoring rules ⋮ Manipulation can be hard in tractable voting systems even for constant-sized coalitions ⋮ Is computational complexity a barrier to manipulation? ⋮ The complexity of manipulative attacks in nearly single-peaked electorates ⋮ 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 ⋮ Control complexity in Bucklin and fallback voting: a theoretical analysis ⋮ A parameterized perspective on protecting elections ⋮ Exact algorithms for weighted and unweighted Borda manipulation problems ⋮ Parameterized complexity of voter control in multi-peaked elections ⋮ Structured preferences: a literature survey ⋮ Combinatorial voter control in elections
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Voting cycles and the structure of individual preferences
- A characterization of the single-peaked domain
- The shield that never was: societies with single-peaked preferences are more open to manipulation and control
- Dichotomy for voting systems
- Anyone but him: the complexity of precluding an alternative
- Recognizing single-peaked preferences on a tree
- Single transferable vote resists strategic voting
- How hard is it to control an election?
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- A heuristic technique for multi-agent planning
- Constant scoring rules, Condorcet criteria and single-peaked preferences
- Stable matching with preferences derived from a psychological model
- The computational difficulty of manipulating an election
- An introduction to strategy-proof social choice functions
- Incidence matrices and interval graphs
- Computational Aspects of Approval Voting
- Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates
- Hybrid Elections Broaden Complexity-Theoretic Resistance to Control
- Sincere-Strategy Preference-Based Approval Voting Fully Resists Constructive Control and Broadly Resists Destructive Control
- When are elections with few candidates hard to manipulate?
- Eliciting Single-Peaked Preferences Using Comparison Queries
- Llull and Copeland Voting Computationally Resist Bribery and Constructive Control
- How Hard Is Bribery in Elections?
- A Polynomial Time Algorithm for Unidimensional Unfolding Representations
- A Richer Understanding of the Complexity of Election Systems
This page was built for publication: The shield that never was: societies with single-peaked preferences are more open to manipulation and control