SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Parameterized computational complexity of Dodgson and Young elections
14 references·0 citing·36 second hop
Parameterized computational complexity of Dodgson and Young elections (2009)Parameterized computational complexity of…Fixed-parameter algorithms for Kemeny rankings (2009)Fixed-parameter algorithms fo…A Richer Understanding of the Complexity of Election Systems (2009)A Richer Understanding of the…Complexity 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…On complexity of lobbying in multiple referenda (2007)On complexity of lobbying in …Anyone but him: The complexity of precluding an alternative (2007)Anyone but him: The complexit…A Short Introduction to Computational Social Choice (2007)A Short Introduction to Compu…Dichotomy for voting systems (2006)Dichotomy for voting systemsExact Complexity of the Winner Problem for Young Elections (2003)Exact Complexity of the Winne…Exact analysis of Dodgson elections (1997)Exact analysis of Dodgson ele…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…Extending Condorcet's rule (1977)Extending Condorcet's ruleSocial Choice and Individual Values. (1951)The Theory of Committees and Elections. (1959)Condorcet Social Choice Functions (1977)Eliciting Single-Peaked Preferences Using Comparison Queries (2009)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)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)Multimode Control Attacks on Elections (2011)Optimal social choice functions (2012)Single transferable vote resists strategic voting (1991)Social Choice Theory and Deliberative Democracy: A Reconciliation (2002)Essai sur l'application de l'analyse à la probabilité des décisions rendues à la pluralité des voix (2014)The computational difficulty of manipulating an election (1989)Computational Social Choice (2012)COUNTERSPECULATION, AUCTIONS, AND COMPETITIVE SEALED TENDERS (1961)Multipart pricing of public goods (1971)Incentives in Teams (1973)Swap Bribery (2009)Computing the margin of victory for various voting rules (2012)Public choice II (1989)The complexity of Kemeny elections (2005)Determining Possible and Necessary Winners Given Partial Orders (2011)Social Choice and Individual Values (1952)A Course in Game Theory (1994)Budgeted social choice: from consensus to personalized decision making (2011)Introduction to Computational Social Choice (2016)Hybrid Elections Broaden Complexity‐Theoretic Resistance to Control (2009)Sincere‐Strategy Preference‐Based Approval Voting Fully Resists Constructive Control and Broadly Resists Destructive Control (2009)Multi-Winner Voting with Approval Preferences (2022)Valuing Freedoms (2002)Collective Preferences in Democratic Politics (2003)The original Borda count and partial voting (2011)
this work references cited by second hop

References

  • 1989Voting schemes for which it can be difficult to tell who won the election548 cited
  • 1995Classics of Social Choice427 cited
  • 2007When are elections with few candidates hard to manipulate?348 cited
  • 2007A Short Introduction to Computational Social Choice264 cited
  • 2007Anyone but him: The complexity of precluding an alternative249 cited
  • 1997Exact analysis of Dodgson elections186 cited
  • 2003Exact Complexity of the Winner Problem for Young Elections128 cited
  • 2006Dichotomy for voting systems128 cited
  • 2008Algorithms for the coalitional manipulation problem126 cited
  • 2008Complexity of Strategic Behavior in Multi-Winner Elections115 cited
  • 1977Extending Condorcet's rule115 cited
  • 2009A Richer Understanding of the Complexity of Election Systems108 cited
  • 2009Fixed-parameter algorithms for Kemeny rankings84 cited
  • 2007On complexity of lobbying in multiple referenda79 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