SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Can Approximation Circumvent Gibbard-Satterthwaite?
16 references·0 citing·29 second hop
Can Approximation Circumvent Gibbard-Satterthwaite? (2010)Can Approximation Circumvent Gibbard-Satt…Nonexistence of Voting Rules That Are Usually Hard to Manipulate (2018)Nonexistence of Voting Rules …Approximate Mechanism Design without Money (2013)Approximate Mechanism Design …Llull and Copeland Voting Computationally Resist Bribery and Constructive Control (2009)Llull and Copeland Voting Com…Approximate mechanism design without money (2009)Approximate mechanism design …Elections Can be Manipulated Often (2008)Elections Can be Manipulated …Copeland voting: ties matter (2008)Copeland voting: ties matterComplexity of Strategic Behavior in Multi-Winner Elections (2008)Complexity of Strategic Behav…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 systemsUniversal 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 …Manipulation of Schemes that Mix Voting with Chance (1977)Manipulation of Schemes that …Strategy-proofness and Arrow's conditions: Existence and correspondence theorems for voting procedures and social welfare functions (1975)Strategy-proofness and Arrow'…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)Multimode Control Attacks on Elections (2011)Essai sur l'application de l'analyse à la probabilité des décisions rendues à la pluralité des voix (2014)Manipulation of Voting Schemes: A General Result (1973)Solutions manual for Microeconomic theory : Mas-Colell, Whinston and Green (1997)How Hard Is Bribery in Elections? (2009)AI's War on Manipulation: Are We Winning? (2010)COUNTERSPECULATION, AUCTIONS, AND COMPETITIVE SEALED TENDERS (1961)College Admissions and the Stability of Marriage (1962)Incentives in Teams (1973)Asymptotically optimal strategy-proof mechanisms for two-facility games (2010)Beyond dominant resource fairness (2012)Computational Social Choice (2012)Social Choice and Individual Values (1952)On the computation of fully proportional representation (2013)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)A Short Introduction to Computational Social Choice (2007)Considerations on Representative Government (2010)Approval Voting (1978)House Allocation with Existing Tenants (1999)How hard is it to control an election? (1992)Optimal Envy-Free Cake Cutting (2011)Introduction to Computational Social Choice (2016)The Price of Anarchy in Auctions (2017)
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,821 cited
  • 1989The computational difficulty of manipulating an election530 cited
  • 1977Manipulation of Schemes that Mix Voting with Chance443 cited
  • 1991Single transferable vote resists strategic voting394 cited
  • 2007When are elections with few candidates hard to manipulate?348 cited
  • 2009Approximate mechanism design without money331 cited
  • 2009Llull and Copeland Voting Computationally Resist Bribery and Constructive Control242 cited
  • 2013Approximate Mechanism Design without Money173 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
  • 2008Complexity of Strategic Behavior in Multi-Winner Elections115 cited
  • 2003Universal Voting Protocol Tweaks to Make Manipulation Hard114 cited
  • 2008Elections Can be Manipulated Often110 cited

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

  • 2008Copeland voting: ties matter108 cited
  • Cited by

    No citing works inside the corpus for this window.