English

Random Knockout Tournaments

Probability 2016-12-15 v1

Abstract

We consider a random knockout tournament among players 1,,n1, \ldots, n, in which each match involves two players. The match format is specified by the number of matches played in each round, where the constitution of the matches in a round is random. Supposing that there are numbers v1,,vnv_1, \ldots, v_n such that a match between ii and jj will be won by ii with probability vivi+vj\frac{v_i}{v_i+v_j}, we obtain a lower bound on the tournament win probability for the best player, as well as upper and lower bounds for all the players. We also obtain additional bounds by considering the best and worst formats for player 11 in the special case v1>v2=v3==vn.v_1 > v_2 = v_3 = \cdots = v_n.

Keywords

Cite

@article{arxiv.1612.04448,
  title  = {Random Knockout Tournaments},
  author = {Ilan Adler and Yang Cao and Richard Karp and Erol Pekoz and Sheldon M. Ross},
  journal= {arXiv preprint arXiv:1612.04448},
  year   = {2016}
}