Choosing from a large tournament
From MaRDI portal
Publication:1024772
DOI10.1007/S00355-007-0279-3zbMATH Open1163.91345OpenAlexW2134014252MaRDI QIDQ1024772FDOQ1024772
Publication date: 17 June 2009
Published in: Social Choice and Welfare (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00355-007-0279-3
Cites Work
- Title not available (Why is that?)
- Sophisticated voting outcomes and agenda control
- Intransitivities in multidimensional voting models and some implications for agenda control
- Random graphs.
- Condorcet Social Choice Functions
- Title not available (Why is that?)
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
- The bipartisan set of a tournament game
- Tournament solutions and majority voting
- Some inequalities relating to the partial sum of binomial probabilities
- Covering sets and a new Condorcet choice correspondence
- Cyclic tournaments and cooperative majority voting: A solution
- Choosing from a tournament
- Condorcet choice correspondences: A set-theoretical comparison
- A Random Voting Graph Almost Surely has a Hamiltonian Cycle when the Number of Alternatives is Large
- Majority voting solution concepts and redistributive taxation
Cited In (12)
- Robust bounds on choosing from large tournaments
- Condorcet choice correspondences for weak tournaments
- Computing minimal extending sets by relation-algebraic modeling and development
- Choice using cyclic tournament relations
- Who Can Win a Single-Elimination Tournament?
- The likelihood of a Condorcet winner in the logrolling setting
- Robust bounds on choosing from large tournaments
- On the Discriminative Power of Tournament Solutions
- Margin of victory for tournament solutions
- The minimal covering set in large tournaments
- On the structure of stable tournament solutions
- Choosing from a weighted tournament
Recommendations
This page was built for publication: Choosing from a large tournament
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1024772)
