Parallel matching for ranking all teams in a tournament

Kei Kobayashi, Hideki Kawasaki, Akimichi Takemura

Research output: Contribution to journalArticlepeer-review


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 languageEnglish
Pages (from-to)804-826
Number of pages23
JournalAdvances in Applied Probability
Issue number3
Publication statusPublished - 2006 Sept
Externally publishedYes


  • 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


Dive into the research topics of 'Parallel matching for ranking all teams in a tournament'. Together they form a unique fingerprint.

Cite this