Dichotomy for voting systems
From MaRDI portal
Publication:859982
DOI10.1016/J.JCSS.2006.09.002zbMATH Open1154.91381OpenAlexW1977012944MaRDI QIDQ859982FDOQ859982
Authors: Edith Hemaspaandra, Lane A. Hemaspaandra 
Publication date: 22 January 2007
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2006.09.002
Recommendations
- Dichotomy for pure scoring rules under manipulative electoral actions
- When are elections with few candidates hard to manipulate?
- The computational difficulty of manipulating an election
- Towards a dichotomy for the possible winner problem in elections based on scoring rules
- Towards a Dichotomy of Finding Possible Winners in Elections Based on Scoring Rules
Cites Work
- Voting schemes for which it can be difficult to tell who won the election
- The complexity of Kemeny elections
- Handbook of social choice and welfare. Vol. 1.
- Strategy-proofness and Arrow's conditions: existence and correspondence theorems for voting procedures and social welfare functions
- Manipulation of Voting Schemes: A General Result
- When are elections with few candidates hard to manipulate?
- Single transferable vote resists strategic voting
- Exact complexity of the winner problem for Young elections
- The computational difficulty of manipulating an election
- Exact analysis of Dodgson elections
- On the average minimum size of a manipulating coalition
- Junta distributions and the average-case complexity of manipulating elections
- Title not available (Why is that?)
- Financial Cryptography and Data Security
- Title not available (Why is that?)
Cited In (28)
- Towards a Dichotomy of Finding Possible Winners in Elections Based on Scoring Rules
- Complexity of control by partitioning veto elections and of control by adding candidates to plurality elections
- Parameterized computational complexity of Dodgson and Young elections
- The learnability of voting rules
- Computational complexity characterization of protecting elections from bribery
- Parameterized Computational Complexity of Dodgson and Young Elections
- Discrepancies in the outcomes resulting from different voting schemes
- The complexity of probabilistic lobbying
- The complexity of online bribery in sequential elections
- Control complexity in Borda elections: solving all open cases of offline control and some cases of online control
- Strategy-proofness of scoring allocation correspondences for indivisible goods
- Multivariate complexity analysis of swap bribery
- Manipulation complexity of same-system runoff elections
- The complexity of online manipulation of sequential elections
- Manipulation can be hard in tractable voting systems even for constant-sized coalitions
- The complexity of manipulative attacks in nearly single-peaked electorates
- Comparing multiagent systems research in combinatorial auctions and voting
- The shield that never was: societies with single-peaked preferences are more open to manipulation and control
- The Efron dice voting system
- Anyone but him: the complexity of precluding an alternative
- Computational Aspects of Approval Voting
- Towards a dichotomy for the possible winner problem in elections based on scoring rules
- Taking the final step to a full dichotomy of the possible winner problem in pure scoring rules
- Optimal social choice functions: a utilitarian view
- Multivariate complexity analysis of Swap Bribery
- Voting Procedures, Complexity of
- Challenges to complexity shields that are supposed to protect elections against manipulation and control: a survey
- Algorithms and Computation
This page was built for publication: Dichotomy for voting systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q859982)
