SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Junta distributions and the average-case complexity of manipulating elections
14 references·0 citing·27 second hopsampled
Junta distributions and the average-case complexity of manipulating elections (2006)Junta distributions and the average-case …Nonexistence of Voting Rules That Are Usually Hard to Manipulate (2018)Nonexistence of Voting Rules …Multi-winner elections: complexity of manipulation, control, and winner-determination (2007)Multi-winner elections: compl…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…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 moviesHow hard is it to control an election? (1992)How hard is it to control an …Single transferable vote resists strategic voting (1991)Single transferable vote resi…Voting schemes for which it can be difficult to tell who won the election (1989)Voting schemes for which it c…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…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)An Introduction to Positive Political Theory (1973)Eliciting Single-Peaked Preferences Using Comparison Queries (2009)Optimal social choice functions (2012)The Theory of Committees and Elections. (1959)Condorcet Social Choice Functions (1977)Epistemic Democracy: Generalizing the Condorcet Jury Theorem (2001)Social Choice Theory and Deliberative Democracy: A Reconciliation (2002)Utility, Strategy, and Social Decision Rules (1960)Stability in Voting (1961)Incentive Compatibility and the Bargaining Problem (1979)The Theory of Incentives: The Principal-Agent Model (2001)A Short Introduction to Computational Social Choice (2007)Considerations on Representative Government (2010)The decision and the organization (1965)Computationally feasible VCG mechanisms (2000)Elections Can be Manipulated Often (2008)Complexity of unweighted coalitional manipulation under some common voting rules (2009)Convergence to Equilibria in Plurality Voting (2010)Computing slater rankings using similarities among candidates (2006)The complexity of bribery in elections (2006)When are elections with few candidates hard to manipulate? (2007)Multiagent systems: algorithmic, game-theoretic, and logical foundations (2009)
this work references cited by second hop· second hop is a sample of the most-cited connections

References

  • 1973Manipulation of Voting Schemes: A General Result3,247 cited
  • 1975Strategy-proofness and Arrow's conditions: Existence and correspondence theorems for voting procedures and social welfare functions2,837 cited
  • 1989Voting schemes for which it can be difficult to tell who won the election548 cited
  • 1989The computational difficulty of manipulating an election530 cited
  • 1991Single transferable vote resists strategic voting394 cited
  • 1992How hard is it to control an election?391 cited
  • 2018Nonexistence of Voting Rules That Are Usually Hard to Manipulate128 cited
  • 2006Dichotomy for voting systems128 cited
  • 2003Universal Voting Protocol Tweaks to Make Manipulation Hard114 cited
  • 2002Complexity of Manipulating Elections with Few Candidates108 cited
  • 1999Voting for movies102 cited
  • 2005Hybrid Voting Protocols and Hardness of Manipulation99 cited
  • 2003How many candidates are needed to make elections hard to manipulate?63 cited
  • 2007Multi-winner elections: complexity of manipulation, control, and winner-determination61 cited

Cited by

No citing works inside the corpus for this window.

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