SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Complexity of and Algorithms for Borda Manipulation
5 references·0 citing·19 second hopsampled
Complexity of and Algorithms for Borda Manipulation (2011)Complexity of and Algorithms for Borda Ma…Complexity of unweighted coalitional manipulation under some common voting rules (2009)Complexity of unweighted coal…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…Single transferable vote resists strategic voting (1991)Single transferable vote resi…The computational difficulty of manipulating an election (1989)The computational difficulty …Manipulation of Voting Schemes: A General Result (1973)Strategy-proofness and Arrow's conditions: Existence and correspondence theorems for voting procedures and social welfare functions (1975)Towards a dichotomy for the Possible Winner problem in elections based on scoring rules (2010)A General Elicitation-Free Protocol for Allocating Indivisible Goods (2011)Barriers to Manipulation in Voting (2016)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)Voting schemes for which it can be difficult to tell who won the election (1989)How hard is it to control an election? (1992)COUNTERSPECULATION, AUCTIONS, AND COMPETITIVE SEALED TENDERS (1961)Multipart pricing of public goods (1971)Incentives in Teams (1973)Swap Bribery (2009)Multimode Control Attacks on Elections (2011)Computing the margin of victory for various voting rules (2012)A Short Introduction to Computational Social Choice (2007)Considerations on Representative Government (2010)
this work references cited by second hop· second hop is a sample of the most-cited connections

References

  • 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
  • 2008Algorithms for the coalitional manipulation problem126 cited
  • 2009Complexity of unweighted coalitional manipulation under some common voting rules108 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