Choosing from a large tournament
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 273667 (Why is no real title available?)
- scientific article; zbMATH DE number 3303831 (Why is no real title available?)
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
- A Random Voting Graph Almost Surely has a Hamiltonian Cycle when the Number of Alternatives is Large
- Choosing from a tournament
- Condorcet Social Choice Functions
- Condorcet choice correspondences: A set-theoretical comparison
- Covering sets and a new Condorcet choice correspondence
- Cyclic tournaments and cooperative majority voting: A solution
- Intransitivities in multidimensional voting models and some implications for agenda control
- Majority voting solution concepts and redistributive taxation
- Random graphs.
- Some inequalities relating to the partial sum of binomial probabilities
- Sophisticated voting outcomes and agenda control
- The bipartisan set of a tournament game
- Tournament solutions and majority voting
Cited in
(15)- Margin of victory for tournament solutions
- The minimal covering set in large tournaments
- The likelihood of a Condorcet winner in the logrolling setting
- Choosing from a tournament
- Choice using cyclic tournament relations
- Condorcet choice correspondences for weak tournaments
- Choosing from a weighted tournament
- Computing minimal extending sets by relation-algebraic modeling and development
- Robust bounds on choosing from large tournaments
- Robust bounds on choosing from large tournaments
- Knockout tournaments
- On the discriminative power of tournament solutions
- Who can win a single-elimination tournament?
- A note on contestation-based tournament solutions
- On the structure of stable tournament solutions
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)
