@article{9b29a6dcbc1b4f19a690678a9bef6549,
title = "Parallel matching for ranking all teams in a tournament",
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.",
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",
author = "Kei Kobayashi and Hideki Kawasaki and Akimichi Takemura",
note = "Copyright: Copyright 2009 Elsevier B.V., All rights reserved.",
year = "2006",
month = sep,
doi = "10.1239/aap/1158685003",
language = "English",
volume = "38",
pages = "804--826",
journal = "Advances in Applied Probability",
issn = "0001-8678",
publisher = "University of Sheffield",
number = "3",
}