The following pages link to Choosing from a large tournament (Q1024772):
Displaying 9 items.
- Computing minimal extending sets by relation-algebraic modeling and development (Q406434) (← links)
- The minimal covering set in large tournaments (Q656810) (← links)
- The likelihood of a Condorcet winner in the logrolling setting (Q1697837) (← links)
- On the structure of stable tournament solutions (Q1707316) (← links)
- Margin of victory for tournament solutions (Q2060724) (← links)
- On the Discriminative Power of Tournament Solutions (Q2806892) (← links)
- Who Can Win a Single-Elimination Tournament? (Q5348496) (← links)
- Robust bounds on choosing from large tournaments (Q5918815) (← links)
- Robust bounds on choosing from large tournaments (Q5970863) (← links)
