SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Average-case tractability of manipulation in voting via the fraction of manipulators
8 references·1 citing·29 second hop
Average-case tractability of manipulation in voting via the fraction of manipulators (2007)Average-case tractability of manipulation…Nonexistence of Voting Rules That Are Usually Hard to Manipulate (2018)Nonexistence of Voting Rules …Universal Voting Protocol Tweaks to Make Manipulation Hard (2003)Universal Voting Protocol Twe…How many candidates are needed to make elections hard to manipulate? (2003)How many candidates are neede…Complexity of Manipulating Elections with Few Candidates (2002)Complexity of Manipulating El…Voting for movies (1999)Voting for moviesSingle transferable vote resists strategic voting (1991)Single transferable vote resi…The computational difficulty of manipulating an election (1989)The computational difficulty …Strategy-proofness and Arrow's conditions: Existence and correspondence theorems for voting procedures and social welfare functions (1975)Strategy-proofness and Arrow'…Where are the hard manipulation problems (2011)Where are the hard manipulati…Social Choice and Individual Values. (1951)Algorithms for the coalitional manipulation problem (2008)Complexity of Strategic Behavior in Multi-Winner Elections (2008)Multimode Control Attacks on Elections (2011)Essai sur l'application de l'analyse à la probabilité des décisions rendues à la pluralité des voix (2014)Voting schemes for which it can be difficult to tell who won the election (1989)Hybrid Voting Protocols and Hardness of Manipulation (2005)Computing slater rankings using similarities among candidates (2006)The complexity of bribery in elections (2006)Manipulation of Voting Schemes: A General Result (1973)How hard is it to control an election? (1992)When are elections with few candidates hard to manipulate? (2007)The Theory of Committees and Elections. (1959)Incentive Compatibility and the Bargaining Problem (1979)The Theory of Incentives: The Principal-Agent Model (2001)Multiagent systems: algorithmic, game-theoretic, and logical foundations (2009)On the Rationale of Group Decision-making (1948)Complexity of and algorithms for the manipulation of Borda, Nanson's and Baldwin's voting rules (2014)A Short Introduction to Computational Social Choice (2007)Considerations on Representative Government (2010)Elections Can be Manipulated Often (2008)Complexity of unweighted coalitional manipulation under some common voting rules (2009)Convergence to Equilibria in Plurality Voting (2010)The Strategy-Proofness Landscape of Merging (1999)Multi-winner elections: complexity of manipulation, control, and winner-determination (2007)Representing and Reasoning with Preferences (2007)Sincere‐Strategy Preference‐Based Approval Voting Fully Resists Constructive Control and Broadly Resists Destructive Control (2009)Voting almost maximizes social welfare despite limited communication (2011)Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates (2015)
this work references cited by second hop

References

  • 1975Strategy-proofness and Arrow's conditions: Existence and correspondence theorems for voting procedures and social welfare functions2,837 cited
  • 1989The computational difficulty of manipulating an election530 cited
  • 1991Single transferable vote resists strategic voting394 cited
  • 2018Nonexistence of Voting Rules That Are Usually Hard to Manipulate128 cited
  • 2003Universal Voting Protocol Tweaks to Make Manipulation Hard114 cited
  • 2002Complexity of Manipulating Elections with Few Candidates108 cited
  • 1999Voting for movies102 cited
  • 2003How many candidates are needed to make elections hard to manipulate?63 cited

Cited by

  • 2011Where are the hard manipulation problems59 cited

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work