SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
A sufficient condition for voting rules to be frequently manipulable
12 references·2 citing·26 second hop
A sufficient condition for voting rules to be frequently manipulable (2008)A sufficient condition for voting rules t…Nonexistence of Voting Rules That Are Usually Hard to Manipulate (2018)Nonexistence of Voting Rules …Elections Can be Manipulated Often (2008)Elections Can be Manipulated …Algorithms for the coalitional manipulation problem (2008)Algorithms for the coalitiona…When are elections with few candidates hard to manipulate? (2007)When are elections with few c…Junta Distributions and the Average-Case Complexity of Manipulating Elections (2007)Junta Distributions and the A…Dichotomy for voting systems (2006)Dichotomy for voting systemsHybrid Voting Protocols and Hardness of Manipulation (2005)Hybrid Voting Protocols and H…Universal Voting Protocol Tweaks to Make Manipulation Hard (2003)Universal Voting Protocol Twe…Single 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'…Manipulation of Voting Schemes: A General Result (1973)Manipulation of Voting Scheme…Where are the hard manipulation problems (2011)Where are the hard manipulati…Ties matter: complexity of voting manipulation revisited (2011)Ties matter: complexity of vo…Voting schemes for which it can be difficult to tell who won the election (1989)Eliciting Single-Peaked Preferences Using Comparison Queries (2009)Social Choice and Individual Values. (1951)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)Solutions manual for Microeconomic theory : Mas-Colell, Whinston and Green (1997)How Hard Is Bribery in Elections? (2009)Llull and Copeland Voting Computationally Resist Bribery and Constructive Control (2009)AI's War on Manipulation: Are We Winning? (2010)An Introduction to Positive Political Theory (1973)Optimal social choice functions (2012)COUNTERSPECULATION, AUCTIONS, AND COMPETITIVE SEALED TENDERS (1961)Multipart pricing of public goods (1971)Incentives in Teams (1973)Swap Bribery (2009)Computing the margin of victory for various voting rules (2012)The Theory of Committees and Elections. (1959)Multiagent systems: algorithmic, game-theoretic, and logical foundations (2009)A Short Introduction to Computational Social Choice (2007)Considerations on Representative Government (2010)Complexity of unweighted coalitional manipulation under some common voting rules (2009)Convergence to Equilibria in Plurality Voting (2010)How hard is it to control an election? (1992)Incentive Compatibility and the Bargaining Problem (1979)The Theory of Incentives: The Principal-Agent Model (2001)
this work references cited by second hop

References

  • 1973Manipulation of Voting Schemes: A General Result3,211 cited
  • 1975Strategy-proofness and Arrow's conditions: Existence and correspondence theorems for voting procedures and social welfare functions2,821 cited
  • 1989The computational difficulty of manipulating an election530 cited
  • 1991Single transferable vote resists strategic voting394 cited
  • 2007When are elections with few candidates hard to manipulate?348 cited
  • 2007Junta Distributions and the Average-Case Complexity of Manipulating Elections148 cited
  • 2018Nonexistence of Voting Rules That Are Usually Hard to Manipulate128 cited
  • 2006Dichotomy for voting systems128 cited
  • 2008Algorithms for the coalitional manipulation problem126 cited
  • 2003Universal Voting Protocol Tweaks to Make Manipulation Hard114 cited
  • 2008Elections Can be Manipulated Often110 cited
  • 2005Hybrid Voting Protocols and Hardness of Manipulation99 cited

Cited by

  • 2011Ties matter: complexity of voting manipulation revisited62 cited
  • 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