SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Exact analysis of Dodgson elections
5 references·16 citing·34 second hop
Exact analysis of Dodgson elections (1997)Exact analysis of Dodgson electionsEssai sur l'application de l'analyse à la probabilité des décisions rendues à la pluralité des voix (2014)Essai sur l'application de l'…Classics of Social Choice (1995)Classics of Social ChoiceVoting schemes for which it can be difficult to tell who won the election (1989)Voting schemes for which it c…Public choice II (1989)Public choice IIThe Theory of Committees and Elections. (1959)The Theory of Committees and …Nonexistence of Voting Rules That Are Usually Hard to Manipulate (2018)Nonexistence of Voting Rules …Optimal social choice functions: A utilitarian view (2015)Optimal social choice functio…Achieving fully proportional representation: Approximability results (2015)Achieving fully proportional …Better Human Computation Through Principled Voting (2013)Better Human Computation Thro…Optimal social choice functions (2012)Optimal social choice functio…Computational Social Choice (2012)Computational Social ChoiceMultimode Control Attacks on Elections (2011)Multimode Control Attacks on …Determining Possible and Necessary Winners Given Partial Orders (2011)Determining Possible and Nece…Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates (2010)Bypassing Combinatorial Prote…A Richer Understanding of the Complexity of Election Systems (2009)A Richer Understanding of the…The complexity of bribery in elections (2006)The complexity of bribery in …Improved bounds for computing Kemeny rankings (2006)Improved bounds for computing…Dichotomy for voting systems (2006)Dichotomy for voting systemsComputing slater rankings using similarities among candidates (2006)Computing slater rankings usi…The complexity of Kemeny elections (2005)The complexity of Kemeny elec…Exact Complexity of the Winner Problem for Young Elections (2003)Exact Complexity of the Winne…Social Choice and Individual Values. (1951)Strategy-proofness and Arrow's conditions: Existence and correspondence theorems for voting procedures and social welfare functions (1975)Complexity of Judgment Aggregation (2012)Judgment Aggregation: A Primer (2014)On Voting and Facility Location (2016)Manipulation of Voting Schemes: A General Result (1973)Robust approximation and incremental elicitation in voting protocols (2011)Campaigns for lazy voters: Truncated ballots (2012)Combinatorial Auctions (2014)Condorcet Social Choice Functions (1977)The computational difficulty of manipulating an election (1989)Single transferable vote resists strategic voting (1991)Social Choice Theory and Deliberative Democracy: A Reconciliation (2002)Social Choice and Individual Values (1952)Voting procedures with incomplete preferences (2005)Theory of Games and Economic Behavior (1945)Stated choice methods analysis and applications (2000)Fair Public Decision Making (2017)Approximating optimal social choice under metric preferences (2018)Theory of games and economic behavior (2019)Participatory Budgeting: Models and Approaches (2020)Information Aggregation, Rationality, and the Condorcet Jury Theorem (1996)Uninformed Votes: Information Effects in Presidential Elections (1996)The Place of Self‐Interest and the Role of Power in Deliberative Democracy* (2009)Preference functions that score rankings and maximum likelihood estimation (2009)Experiments with Kemeny ranking: What works when? (2011)Poverty: An Ordinal Approach to Measurement (1976)Testing Theories of American Politics: Elites, Interest Groups, and Average Citizens (2014)Valuing Freedoms (2002)Collective Preferences in Democratic Politics (2003)The original Borda count and partial voting (2011)Does Social Capital Have an Economic Payoff? A Cross-Country Investigation (1997)A Theory of Fairness, Competition, and Cooperation (1999)Increasing Returns, Path Dependence, and the Study of Politics (2000)
this work references cited by second hop

References

  • 1959The Theory of Committees and Elections.2,822 cited
  • 2014Essai sur l'application de l'analyse à la probabilité des décisions rendues à la pluralité des voix1,418 cited
  • 1989Public choice II1,285 cited
  • 1989Voting schemes for which it can be difficult to tell who won the election548 cited
  • 1995Classics of Social Choice427 cited

Cited by

  • 2005The complexity of Kemeny elections184 cited
  • 2011Determining Possible and Necessary Winners Given Partial Orders172 cited
  • 2012Computational Social Choice162 cited
  • 2015Optimal social choice functions: A utilitarian view149 cited
  • 2006Improved bounds for computing Kemeny rankings148 cited
  • 2018Nonexistence of Voting Rules That Are Usually Hard to Manipulate128 cited
  • 2003Exact Complexity of the Winner Problem for Young Elections128 cited
  • 2006Dichotomy for voting systems128 cited
  • 2012Optimal social choice functions117 cited
  • 2011Multimode Control Attacks on Elections117 cited
  • 2009A Richer Understanding of the Complexity of Election Systems

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

108 cited
  • 2013Better Human Computation Through Principled Voting107 cited
  • 2015Achieving fully proportional representation: Approximability results96 cited
  • 2006The complexity of bribery in elections91 cited
  • 2006Computing slater rankings using similarities among candidates91 cited
  • 2010Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates84 cited