✦ LIBER ✦

Constructing fair round robin tournaments with a minimum number of breaks

✍ Scribed by Pim van ’t Hof; Gerhard Post; Dirk Briskorn

Publisher: Elsevier Science
Year: 2010
Tongue: English
Weight: 228 KB
Volume: 38
Category: Article
ISSN: 0167-6377
DOI: 10.1016/j.orl.2010.08.008

No coin nor oath required. For personal study only.

✦ Synopsis

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 the first round. We also consider a fairness constraint related to different playing strengths of teams competing in the tournament.

📜 SIMILAR VOLUMES

An algorithm for construction of a k-con

An algorithm for construction of a k-connected graph with minimum number of edges and quasiminimal diameter

✍ Ulrich Schumacher 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 470 KB

Two fundamental considerations in the design of a communication network are reliability and maximum transmission delay. In this paper we give an algorithm for construction of an undirected graph with n vertices in which there are k node-disjoint paths between any two nodes. The generated graphs will