𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A new algorithm for ranking players of a round-robin tournament

✍ Scribed by Mohammad Kaykobad; Q.N.U. Ahmed; A.T.M. Shafiqul Khalid; Rezwan-al Bakhtiar

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
370 KB
Volume
22
Category
Article
ISSN
0305-0548

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A combinatorial property of the maximum
A combinatorial property of the maximum round robin tournament problem
✍ Andrei Horbach πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 430 KB

We prove a new combinatorial property of the maximum round robin tournament (MRRT) problem. This property allows us to answer negatively the question of Briskorn, whether the optimal objective value of the MRRT problem and that of its conventional linear relaxation always coincide.

Constructing fair round robin tournament
Constructing fair round robin tournaments with a minimum number of breaks
✍ Pim van ’t Hof; Gerhard Post; Dirk Briskorn πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 228 KB

Given n clubs with two teams each, we show that, if n is even, it is possible to construct a schedule for a single round robin tournament satisfying the following properties: the number of breaks is 2n -2, teams of the same club never play at home simultaneously, and they play against each other in

Existence of Z-Cyclic Triplewhist Tourna
Existence of Z-Cyclic Triplewhist Tournaments for a Prime Number of Players
✍ Marco Buratti πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 123 KB

A Z-cyclic triplewhist tournament for 4n+1 players, or briefly a TWh(4n+1), is equivalent to a . The existence problem for Z-cyclic TWh( p)'s with p a prime has been solved for p 1 (mod 16). I. Anderson