On the discriminative power of tournament solutions
From MaRDI portal
(Redirected from Publication:2806892)
Recommendations
Cites work
Cited in
(16)- A survey on the complexity of tournament solutions
- Extending tournament solutions
- On the structure of stable tournament solutions
- Determining the results of tournament games using complete graphs generation
- Composition-consistent tournament solutions and social choice functions
- Margin of victory for tournament solutions
- \(k\)-majority digraphs and the hardness of voting with a constant number of voters
- Bounds on the disparity and separation of tournament solutions
- An analytical and experimental comparison of maximal lottery schemes
- Unsupervised fuzzy tournament selection
- Analyzing the Practical Relevance of the Condorcet Loser Paradox and the Agenda Contraction Paradox
- Robust bounds on choosing from large tournaments
- Robust bounds on choosing from large tournaments
- Characterizing the top cycle via strategyproofness
- Measuring violations of positive involvement in voting
- A computational analysis of the tournament equilibrium set
This page was built for publication: On the discriminative power of tournament solutions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2806892)