A Richer Understanding of the Complexity of Election Systems
From MaRDI portal
Publication:5192366
DOI10.1007/978-1-4020-9688-4_14zbMath1167.91339arXivcs/0609112OpenAlexW1644945789MaRDI QIDQ5192366
Piotr Faliszewski, Hemaspaandra, Lane A., Edith Hemaspaandra, Jörg Rothe
Publication date: 5 August 2009
Published in: Fundamental Problems in Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/cs/0609112
Related Items (30)
A statistical approach to calibrating the scores of biased reviewers of scientific papers ⋮ Manipulation complexity of same-system runoff elections ⋮ On the hardness of bribery variants in voting with CP-nets ⋮ Studies in Computational Aspects of Voting ⋮ The complexity of online manipulation of sequential elections ⋮ Often Harder than in the Constructive Case: Destructive Bribery in CP-nets ⋮ Computational complexity of manipulation: a survey ⋮ The complexity of probabilistic lobbying ⋮ Taking the final step to a full dichotomy of the possible winner problem in pure scoring rules ⋮ The shield that never was: societies with single-peaked preferences are more open to manipulation and control ⋮ Manipulating the quota in weighted voting games ⋮ Challenges to complexity shields that are supposed to protect elections against manipulation and control: a survey ⋮ Towards a dichotomy for the possible winner problem in elections based on scoring rules ⋮ The consequences of eliminating NP solutions ⋮ Lifting integrity constraints in binary aggregation ⋮ Complexity of and algorithms for the manipulation of Borda, Nanson's and Baldwin's voting rules ⋮ The complexity of manipulative attacks in nearly single-peaked electorates ⋮ Voting Procedures, Complexity of ⋮ On complexity of lobbying in multiple referenda ⋮ Control complexity in Borda elections: solving all open cases of offline control and some cases of online control ⋮ Control complexity in Bucklin and fallback voting: a theoretical analysis ⋮ Control complexity in Bucklin and fallback voting: an experimental analysis ⋮ Parameterized computational complexity of Dodgson and Young elections ⋮ Hybrid Elections Broaden Complexity-Theoretic Resistance to Control ⋮ Sincere-Strategy Preference-Based Approval Voting Fully Resists Constructive Control and Broadly Resists Destructive Control ⋮ The Computational Complexity of Choice Sets ⋮ Anyone but him: the complexity of precluding an alternative ⋮ Computing properties of stable configurations of thermodynamic binding networks ⋮ \(k\)-majority digraphs and the hardness of voting with a constant number of voters ⋮ Parameterized complexity of candidate control in elections and related digraph problems
This page was built for publication: A Richer Understanding of the Complexity of Election Systems
