Dichotomy for voting systems
From MaRDI portal
Publication:859982
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
- scientific article; zbMATH DE number 2080215 (Why is no real title available?)
- scientific article; zbMATH DE number 1759396 (Why is no real title available?)
- Exact analysis of Dodgson elections
- Exact complexity of the winner problem for Young elections
- Financial Cryptography and Data Security
- Handbook of social choice and welfare. Vol. 1.
- Junta distributions and the average-case complexity of manipulating elections
- Manipulation of Voting Schemes: A General Result
- On the average minimum size of a manipulating coalition
- Single transferable vote resists strategic voting
- Strategy-proofness and Arrow's conditions: existence and correspondence theorems for voting procedures and social welfare functions
- The complexity of Kemeny elections
- The computational difficulty of manipulating an election
- Voting schemes for which it can be difficult to tell who won the election
- When are elections with few candidates hard to manipulate?
Cited in
(29)- The complexity of probabilistic lobbying
- The complexity of manipulative attacks in nearly single-peaked electorates
- The complexity of online bribery in sequential elections
- Computational complexity characterization of protecting elections from bribery
- Multivariate complexity analysis of Swap Bribery
- Dichotomy for pure scoring rules under manipulative electoral actions
- Towards a dichotomy for the possible winner problem in elections based on scoring rules
- Comparing multiagent systems research in combinatorial auctions and voting
- Parameterized Computational Complexity of Dodgson and Young Elections
- Complexity of control by partitioning veto elections and of control by adding candidates to plurality elections
- Anyone but him: the complexity of precluding an alternative
- Strategy-proofness of scoring allocation correspondences for indivisible goods
- Parameterized computational complexity of Dodgson and Young elections
- Towards a Dichotomy of Finding Possible Winners in Elections Based on Scoring Rules
- The complexity of online manipulation of sequential elections
- Multivariate complexity analysis of swap bribery
- Manipulation complexity of same-system runoff elections
- 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
- Discrepancies in the outcomes resulting from different voting schemes
- Challenges to complexity shields that are supposed to protect elections against manipulation and control: a survey
- The Efron dice voting system
- Voting procedures, complexity of
- Optimal social choice functions: a utilitarian view
- Manipulation can be hard in tractable voting systems even for constant-sized coalitions
- Computational Aspects of Approval Voting
- Algorithms and Computation
- The shield that never was: societies with single-peaked preferences are more open to manipulation and control
- The learnability of voting rules
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)
