Efficient Simulation of a Random Knockout Tournament
Authors
Abstract:
We consider the problem of using simulation to efficiently estimate the win probabilities for participants in a general random knockout tournament. Both of our proposed estimators, one based on the notion of “observed survivals” and the other based on conditional expectation and post-stratification, are highly effective in terms of variance reduction when compared to the raw simulation estimator. For the special case of a classical 2n -player random knockout tournament, where each survivor of the previous round plays in the current round, a second conditional expectation based estimator is introduced. At the end, we compare our proposed simulation estimators based on a numerical example and in terms of both variance reduction and the time to complete the simulation experiment. Based on our empirical study, the method of “observed survivals” is the most efficient method.
similar resources
Fixing a Balanced Knockout Tournament
Balanced knockout tournaments are one of the most common formats for sports competitions, and are also used in elections and decision-making. We consider the computational problem of finding the optimal draw for a particular player in such a tournament. The problem has generated considerable research within AI in recent years. We prove that checking whether there exists a draw in which a player...
full textA theory of knockout tournament seedings
This paper provides nested sets and vector representations of knockout tournaments. The paper introduces classification of probability domain assumptions and a new set of axioms. Two new seeding methods are proposed: equal gap seeding and increasing competitive intensity seeding. Under different probability domain assumptions, several axiomatic justifications are obtained for equal gap seeding....
full textUniversal statistics of the knockout tournament
We study statistics of the knockout tournament, where only the winner of a fixture progresses to the next. We assign a real number called competitiveness to each contestant and find that the resulting distribution of prize money follows a power law with an exponent close to unity if the competitiveness is a stable quantity and a decisive factor to win a match. Otherwise, the distribution is fou...
full textHamilton Cycles in a Random Tournament
The number of Hamilton cycles in a random tournament is asymptotically normally distributed.
full textEfficient Simulation of Random Signal Detectors
As the complexity of a detection algorithm increases, analytic performance evaluation becomes increasingly difficult and is often intractable. In such cases, Monte Carlo sunulations can be used, but they often require an excessive amount of computation. As a means of reducing this computation, importance sampling has been applied with great success to simulations of digital communications recei...
full textEfficient Modelling and Simulation of Random Fields
The application of random fields to real-world problems, e.g. for assessing the robustness and reliability of structural components with geometrical or material tolerances, has gained much interest recently. However, the large number of random variables involved inhibits the use of accurate and efficient methods to compute failure probabilities. Several measures to handle the large dimension or...
full textMy Resources
Journal title
volume 2 issue 2
pages 88- 96
publication date 2008-08-01
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023