Pages that link to "Item:Q5348496"
From MaRDI portal
The following pages link to Who Can Win a Single-Elimination Tournament? (Q5348496):
Displaying 11 items.
- Margin of victory for tournament solutions (Q2060724) (← links)
- Controlling sub-tournaments: easy or hard problem? Theoretical vs. practical analysis (Q2330543) (← links)
- Tennis manipulation: can we help Serena Williams win another tournament? Or can we control a knockout tournament with reasonable complexity? (Q2363601) (← links)
- Condorcet-consistent and approximately strategyproof tournament rules (Q4638087) (← links)
- Knockout-Tournament Procedures for Large-Scale Ranking and Selection in Parallel Computing Environments (Q5031020) (← links)
- Single-Elimination Brackets Fail to Approximate Copeland Winner. (Q5875465) (← links)
- Robust bounds on choosing from large tournaments (Q5918815) (← links)
- Robust bounds on choosing from large tournaments (Q5970863) (← links)
- Fixing knockout tournaments with seeds (Q6064833) (← links)
- Query complexity of tournament solutions (Q6122601) (← links)
- Tight bounds on 3-team manipulations in randomized death match (Q6167255) (← links)