SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Complexity of unweighted coalitional manipulation under some common voting rules
13 references·6 citing·25 second hop
Complexity of unweighted coalitional manipulation under some common voting rules (2009)Complexity of unweighted coalitional mani…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 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 …Independence of clones as a criterion for voting rules (1987)Independence of clones as a c…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…A Theorem on the Construction of Voting Paradoxes (1953)A Theorem on the Construction…Barriers to Manipulation in Voting (2016)Barriers to Manipulation in V…Dominating Manipulations in Voting with Partial Information (2011)Dominating Manipulations in V…Complexity of and Algorithms for Borda Manipulation (2011)Complexity of and Algorithms …A General Elicitation-Free Protocol for Allocating Indivisible Goods (2011)A General Elicitation-Free Pr…Towards a dichotomy for the Possible Winner problem in elections based on scoring rules (2010)Towards a dichotomy for the P…A multivariate complexity analysis of determining possible winners given incomplete votes (2009)A multivariate complexity ana…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)Social Choice and Individual Values (1952)The Theory of Committees and Elections. (1959)Chapter 4 Voting procedures (2002)A new monotonic, clone-independent, reversal symmetric, and condorcet-consistent single-winner election method (2010)Watch me playing, i am a professional (2012)A Short Introduction to Computational Social Choice (2007)Considerations on Representative Government (2010)Rank Correlation Methods. (1957)Geometry of voting (1994)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)Multiagent systems: algorithmic, game-theoretic, and logical foundations (2009)
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
  • 1987Independence of clones as a criterion for voting rules338 cited
  • 1953A Theorem on the Construction of Voting Paradoxes332 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

Cited by

  • 2010Towards a dichotomy for the Possible Winner problem in elections based on scoring rules87 cited
  • 2016Barriers to Manipulation in Voting

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

81 cited
  • 2011A General Elicitation-Free Protocol for Allocating Indivisible Goods80 cited
  • 2011Dominating Manipulations in Voting with Partial Information77 cited
  • 2011Complexity of and Algorithms for Borda Manipulation75 cited
  • 2009A multivariate complexity analysis of determining possible winners given incomplete votes71 cited