Random knockout tournaments
From MaRDI portal
Abstract: We consider a random knockout tournament among players , in which each match involves two players. The match format is specified by the number of matches played in each round, where the constitution of the matches in a round is random. Supposing that there are numbers such that a match between and will be won by with probability , we obtain a lower bound on the tournament win probability for the best player, as well as upper and lower bounds for all the players. We also obtain additional bounds by considering the best and worst formats for player in the special case
Recommendations
Cited in
(19)- Stronger players win more balanced knockout tournaments
- Elo ratings and the sports model: a neglected topic in applied probability?
- Randomness in competitions
- The efficacy of tournament designs
- Bayesian locally optimal design of knockout tournaments
- What is the Correct Way to Seed a Knockout Tournament?
- scientific article; zbMATH DE number 3907559 (Why is no real title available?)
- A new and flexible approach to the analysis of paired comparison data
- Team's seasonal win probabilities
- Winner plays competition models
- WINNER PLAYS STRUCTURE IN RANDOM KNOCKOUT TOURNAMENTS
- Surprises in Knockout Tournaments
- An unexpected characteristic of tournament predictive power
- Fixing knockout tournaments with seeds
- On Tournaments and negative dependence
- Tournament design: a review from an operational research perspective
- The football model, stochastic ordering and martingale transport
- Negative dependence in knockout tournaments
- Extreme score distributions in countable-outcome round-robin tournaments of equally strong players
This page was built for publication: Random knockout tournaments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4602473)