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
Externally publishedYes

Fingerprint

Tournament
Sorting
Ranking
Lattice Paths
Sorting algorithm
Parallel Algorithms
Counting

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

  • Mathematics(all)
  • Statistics and Probability

Cite this

Parallel matching for ranking all teams in a tournament. / Kobayashi, Kei; Kawasaki, Hideki; Takemura, Akimichi.

In: Advances in Applied Probability, Vol. 38, No. 3, 09.2006, p. 804-826.

Research output: Contribution to journalArticle

Kobayashi, Kei ; Kawasaki, Hideki ; Takemura, Akimichi. / Parallel matching for ranking all teams in a tournament. In: Advances in Applied Probability. 2006 ; Vol. 38, No. 3. pp. 804-826.
@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",
year = "2006",
month = "9",
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",

}

TY - JOUR

T1 - Parallel matching for ranking all teams in a tournament

AU - Kobayashi, Kei

AU - Kawasaki, Hideki

AU - Takemura, Akimichi

PY - 2006/9

Y1 - 2006/9

N2 - 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.

AB - 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.

KW - Ballot problem

KW - Bradley-Terry model

KW - Extreme value distribution

KW - Hasse diagram

KW - Kolmogorov-Smirnov statistic

KW - Lattice path counting

KW - Odd-even merge

KW - Parallel sorting

KW - Partially ordered set

UR - http://www.scopus.com/inward/record.url?scp=33749556723&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33749556723&partnerID=8YFLogxK

U2 - 10.1239/aap/1158685003

DO - 10.1239/aap/1158685003

M3 - Article

AN - SCOPUS:33749556723

VL - 38

SP - 804

EP - 826

JO - Advances in Applied Probability

JF - Advances in Applied Probability

SN - 0001-8678

IS - 3

ER -