Parallel matching for ranking all teams in a tournament

Kei Kobayashi, Hideki Kawasaki, Akimichi Takemura

Research output: Contribution to journalArticle

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

    Fingerprint

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

Cite this