A Richer Understanding of the Complexity of Election Systems
From MaRDI portal
Publication:5192366
Abstract: We provide an overview of some recent progress on the complexity of election systems. The issues studied include the complexity of the winner, manipulation, bribery, and control problems.
Cited in
(35)- The complexity of probabilistic lobbying
- The complexity of manipulative attacks in nearly single-peaked electorates
- Control complexity in Bucklin and fallback voting: a theoretical analysis
- A Multivariate Complexity Analysis of Lobbying in Multiple Referenda
- Often Harder than in the Constructive Case: Destructive Bribery in CP-nets
- Evaluation and Optimization of Electoral Systems
- Towards a dichotomy for the possible winner problem in elections based on scoring rules
- Lifting integrity constraints in binary aggregation
- Anyone but him: the complexity of precluding an alternative
- Parameterized computational complexity of Dodgson and Young elections
- \(k\)-majority digraphs and the hardness of voting with a constant number of voters
- Election in the Qualitative World
- Parameterized complexity of candidate control in elections and related digraph problems
- The complexity of online manipulation of sequential elections
- Manipulation complexity of same-system runoff elections
- On the hardness of bribery variants in voting with CP-nets
- Control complexity in Borda elections: solving all open cases of offline control and some cases of online control
- Taking the final step to a full dichotomy of the possible winner problem in pure scoring rules
- Hybrid Elections Broaden Complexity-Theoretic Resistance to Control
- The Computational Complexity of Choice Sets
- Sincere-Strategy Preference-Based Approval Voting Fully Resists Constructive Control and Broadly Resists Destructive Control
- Challenges to complexity shields that are supposed to protect elections against manipulation and control: a survey
- Complexity of and algorithms for the manipulation of Borda, Nanson's and Baldwin's voting rules
- Studies in Computational Aspects of Voting
- Computational complexity of manipulation: a survey
- Voting procedures, complexity of
- Analysis and design of electoral systems
- A statistical approach to calibrating the scores of biased reviewers of scientific papers
- The complexity of Kemeny elections
- Control complexity in Bucklin and fallback voting: an experimental analysis
- Computing properties of stable configurations of thermodynamic binding networks
- Manipulating the quota in weighted voting games
- The shield that never was: societies with single-peaked preferences are more open to manipulation and control
- The consequences of eliminating NP solutions
- On complexity of lobbying in multiple referenda
This page was built for publication: A Richer Understanding of the Complexity of Election Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5192366)
