English

Merging Knockout and Round-Robin Tournaments: A Flexible Linear Elimination Tournament Design

Computer Science and Game Theory 2022-03-24 v1 Discrete Mathematics Machine Learning Combinatorics Machine Learning

Abstract

We propose a new tournament structure that combines the popular knockout tournaments and the round-robin tournaments. As opposed to the extremes of divisive elimination and no elimination, our tournament aims to eliminate the participants as linearly as possible as a form of subtractive elimination. Our design is flexible in the sense that it can be adapted to any number of players NN and any number of matches MM. Our design satisfies many properties that are desirable for a tournament to select a winner and can be adapted to rank all the participating players.

Keywords

Cite

@article{arxiv.2203.12011,
  title  = {Merging Knockout and Round-Robin Tournaments: A Flexible Linear Elimination Tournament Design},
  author = {Kaan Gokcesu and Hakan Gokcesu},
  journal= {arXiv preprint arXiv:2203.12011},
  year   = {2022}
}