Pages that link to "Item:Q2806892"
From MaRDI portal
The following pages link to On the Discriminative Power of Tournament Solutions (Q2806892):
Displaying 14 items.
- A computational analysis of the tournament equilibrium set (Q964822) (← links)
- A survey on the complexity of tournament solutions (Q1042317) (← links)
- On the structure of stable tournament solutions (Q1707316) (← links)
- Determining the results of tournament games using complete graphs generation (Q1715680) (← links)
- Margin of victory for tournament solutions (Q2060724) (← links)
- \(k\)-majority digraphs and the hardness of voting with a constant number of voters (Q2316935) (← links)
- Bounds on the disparity and separation of tournament solutions (Q2348052) (← links)
- An analytical and experimental comparison of maximal lottery schemes (Q2667570) (← links)
- Unsupervised fuzzy tournament selection (Q2908232) (← links)
- Analyzing the Practical Relevance of the Condorcet Loser Paradox and the Agenda Contraction Paradox (Q5053688) (← links)
- Robust bounds on choosing from large tournaments (Q5918815) (← links)
- Robust bounds on choosing from large tournaments (Q5970863) (← links)
- Characterizing the top cycle via strategyproofness (Q6076911) (← links)
- Measuring violations of positive involvement in voting (Q6642575) (← links)