When are elections with few candidates hard to manipulate?
From MaRDI portal
Publication:3546334
DOI10.1145/1236457.1236461zbMATH Open1292.91062OpenAlexW1972375916MaRDI QIDQ3546334FDOQ3546334
Authors: Vincent Conitzer, Tuomas Sandholm, Jérôme Lang 
Publication date: 21 December 2008
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1236457.1236461
Recommendations
Cited In (90)
- Towards a Dichotomy of Finding Possible Winners in Elections Based on Scoring Rules
- Studies in Computational Aspects of Voting
- Complexity of control by partitioning veto elections and of control by adding candidates to plurality elections
- Parameterized computational complexity of Dodgson and Young elections
- Financial Cryptography and Data Security
- The learnability of voting rules
- Parameterized complexity of candidate control in elections and related digraph problems
- Complexity of manipulation with partial information in voting
- The complexity of probabilistic lobbying
- Control complexity in Bucklin and fallback voting: an experimental analysis
- Ranking chain sum orders
- Choosing the best among peers
- Complexity of safe strategic voting
- Copeland Voting Fully Resists Constructive Control
- Title not available (Why is that?)
- Manipulation complexity of same-system runoff elections
- Schulze and ranked-pairs voting are fixed-parameter tractable to bribe, manipulate, and control
- Control of Condorcet voting: complexity and a relation-algebraic approach
- The complexity of online manipulation of sequential elections
- Hybrid Elections Broaden Complexity-Theoretic Resistance to Control
- New candidates welcome! Possible winners with respect to the addition of new candidates
- Complexity of and algorithms for the manipulation of Borda, Nanson's and Baldwin's voting rules
- Manipulation can be hard in tractable voting systems even for constant-sized coalitions
- The complexity of manipulative attacks in nearly single-peaked electorates
- Parameterized Complexity of Candidate Control in Elections and Related Digraph Problems
- Comparing multiagent systems research in combinatorial auctions and voting
- Solving hard control problems in voting systems via integer programming
- The shield that never was: societies with single-peaked preferences are more open to manipulation and control
- Parameterized complexity of control problems in Maximin election
- Algorithms for the coalitional manipulation problem
- Dichotomy for voting systems
- Computational complexity of manipulation: a survey
- Complexity of manipulation and bribery in judgment aggregation for uniform premise-based quota rules
- On the complexity of bribery and manipulation in tournaments with uncertain information
- Is computational complexity a barrier to manipulation?
- Is it ever safe to vote strategically?
- Anyone but him: the complexity of precluding an alternative
- Parameterized computational complexity of control problems in voting systems
- Binary linear programming solutions and non-approximability for control problems in voting systems
- Single transferable vote resists strategic 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
- On the evaluation of election outcomes under uncertainty
- Distance restricted manipulation in voting
- Complexity of strategic behavior in multi-winner elections
- Multivariate complexity analysis of Swap Bribery
- Where are the hard manipulation problems?
- Cloning in elections: finding the possible winners
- Weighted manipulation for four-candidate Llull is easy
- Search versus decision for election manipulation problems
- A note on the complexity of manipulating weighted Schulze voting
- Control complexity in Bucklin and fallback voting: a theoretical analysis
- Parameterized complexity of control and bribery for \(d\)-approval elections
- Parameterized complexity of control and bribery for \(d\)-approval elections
- Bribery in voting with CP-nets
- Challenges to complexity shields that are supposed to protect elections against manipulation and control: a survey
- Junta distributions and the average-case complexity of manipulating elections
- A new perspective on implementation by voting trees
- The complexity of controlling candidate-sequential elections
- Frugal bribery in voting
- Algorithms and Computation
- Manipulative agendas in four-candidate elections
- Weighted partial order oriented three-way decisions under score-based common voting rules
- \(k\)-majority digraphs and the hardness of voting with a constant number of voters
- Controlling sub-tournaments: easy or hard problem? Theoretical vs. practical analysis
- Parameterized Computational Complexity of Dodgson and Young Elections
- The complexity of online bribery in sequential elections
- Isomorphic Distances Among Elections
- Control complexity in Borda elections: solving all open cases of offline control and some cases of online control
- Election Manipulation 100
- Multivariate complexity analysis of swap bribery
- The possible winner problem with uncertain weights revisited
- Resolute control: forbidding candidates from winning an election is hard
- Complexity of control in judgment aggregation for uniform premise-based quota rules
- Exact algorithms for weighted and unweighted Borda manipulation problems
- Complexity of shift bribery for iterative voting rules
- On the safety of group manipulation
- Local distance constrained bribery in voting
- Protecting elections by recounting ballots
- Election manipulation on social networks: seeding, edge removal, edge addition
- Complexity of manipulative actions when voting with ties
- Title not available (Why is that?)
- Toward Computing the Margin of Victory in Single Transferable Vote Elections
- Strategic behaviour and manipulation resistance in peer-to-peer, crowdsourced information gathering
- Strategic voting in negotiating teams
- Mixed integer programming with convex/concave constraints: fixed-parameter tractability and applications to multicovering and voting
- Complexity of conformant election manipulation
- The communication burden of single transferable vote, in practice
- Stability, optimality and manipulation in matching problems with weighted preferences
- The possible winner with uncertain weights problem
This page was built for publication: When are elections with few candidates hard to manipulate?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3546334)
