Parallel matching for ranking all teams in a tournament
Kei Kobayashi, Hideki Kawasaki, Akimichi Takemura · Advances in Applied Probability · 2006
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.