Abstract
We propose a simple and efficient scheme for ranking all teams in a tournament where matches can be played simultaneously. We show that the distribution of the number of rounds of the proposed scheme can be derived using lattice path counting techniques used in ballot problems. We also discuss our method from the viewpoint of parallel sorting algorithms.
| Original language | English |
|---|---|
| Pages (from-to) | 804-826 |
| Number of pages | 23 |
| Journal | Advances in Applied Probability |
| Volume | 38 |
| Issue number | 3 |
| DOIs | |
| Publication status | Published - 2006 Sept |
| Externally published | Yes |
Keywords
- Ballot problem
- Bradley-Terry model
- Extreme value distribution
- Hasse diagram
- Kolmogorov-Smirnov statistic
- Lattice path counting
- Odd-even merge
- Parallel sorting
- Partially ordered set
ASJC Scopus subject areas
- Statistics and Probability
- Applied Mathematics