SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Possible and Necessary Winners of Partial Tournaments
16 references·0 citing·31 second hop
Possible and Necessary Winners of Partial Tournaments (2015)Possible and Necessary Winners of Partial…Campaigns for lazy voters: Truncated ballots (2012)Campaigns for lazy voters: Tr…Determining Possible and Necessary Winners Given Partial Orders (2011)Determining Possible and Nece…Towards a dichotomy for the Possible Winner problem in elections based on scoring rules (2010)Towards a dichotomy for the P…AI's War on Manipulation: Are We Winning? (2010)AI's War on Manipulation: Are…Uncertainty in preference elicitation and aggregation (2007)Uncertainty in preference eli…A survey on the linear ordering problem for weighted or unweighted tournaments (2007)A survey on the linear orderi…Voting procedures with incomplete preferences (2005)Voting procedures with incomp…Vote elicitation: complexity and strategy-proofness (2002)Vote elicitation: complexity …Comparison functions and choice correspondences (1999)Comparison functions and choi…Tournament Solutions and Majority Voting (1997)Tournament Solutions and Majo…The Bipartisan Set of a Tournament Game (1993)The Bipartisan Set of a Tourn…How hard is it to control an election? (1992)How hard is it to control an …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…The Logic of Collective Choice (1986)The Logic of Collective ChoiceAggregation of Preferences with Variable Electorate (1973)Aggregation of Preferences wi…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)Robust approximation and incremental elicitation in voting protocols (2011)Computational Social Choice (2012)Combinatorial Auctions (2014)Chapter 4 Voting procedures (2002)The complexity of Kemeny elections (2005)Computational Aspects of Multi-Winner Approval Voting (2015)Voting schemes for which it can be difficult to tell who won the election (1989)Single transferable vote resists strategic voting (1991)When are elections with few candidates hard to manipulate? (2007)Social Choice and Individual Values. (1951)A Set of Independent Necessary and Sufficient Conditions for Simple Majority Decision (1952)On Weights and Measures: Informational Constraints in Social Welfare Analysis (1977)On measuring the quality of life (1992)Multiagent systems: algorithmic, game-theoretic, and logical foundations (2009)Social Choice and Individual Values (1952)The Theory of Committees and Elections. (1959)Watch me playing, i am a professional (2012)The decision and the organization (1965)Computationally feasible VCG mechanisms (2000)A Short Introduction to Computational Social Choice (2007)Evaluation and Decision Models (2000)Properties of multiwinner voting rules (2014)Bounds for Mixed Strategy Equilibria and the Spatial Model of Elections (2002)Distributive Politics and Electoral Competition (2002)Legislative leviathan: party government in the House (1993)Fuzzy sets and decision analysis (1997)A new monotonic, clone-independent, reversal symmetric, and condorcet-consistent single-winner election method (2010)Approximate Mechanism Design without Money (2013)On the computation of fully proportional representation (2013)
this work references cited by second hop

References

  • 1989The computational difficulty of manipulating an election530 cited
  • 1973Aggregation of Preferences with Variable Electorate496 cited
  • 1992How hard is it to control an election?391 cited
  • 1997Tournament Solutions and Majority Voting387 cited
  • 1987Independence of clones as a criterion for voting rules338 cited
  • 1986The Logic of Collective Choice264 cited
  • 2010AI's War on Manipulation: Are We Winning?191 cited
  • 2011Determining Possible and Necessary Winners Given Partial Orders172 cited
  • 2005Voting procedures with incomplete preferences165 cited
  • 1993The Bipartisan Set of a Tournament Game141 cited
  • 2007Uncertainty in preference elicitation and aggregation139 cited
  • 2002Vote elicitation: complexity and strategy-proofness110 cited
  • 1999Comparison functions and choice correspondences110 cited
  • 2012Campaigns for lazy voters: Truncated ballots95 cited
  • 2010Towards a dichotomy for the Possible Winner problem in elections based on scoring rules87 cited
  • 2007A survey on the linear ordering problem for weighted or unweighted tournaments

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

75 cited

Cited by

No citing works inside the corpus for this window.