Constructing fair round robin tournaments with a minimum number of breaks

Pim van 't Hof; Gerhard Post; Dirk Briskorn

doi:10.1016/j.orl.2010.08.008

Constructing fair round robin tournaments with a minimum number of breaks

Pim van 't Hof, Gerhard Post, Dirk Briskorn

Discrete Mathematics and Mathematical Programming

Research output: Contribution to journal › Article › Academic › peer-review

19 Citations (Scopus)

17 Downloads (Pure)

Abstract

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.

Original language	English
Pages (from-to)	592-596
Number of pages	5
Journal	Operations research letters
Volume	38
Issue number	6
DOIs	https://doi.org/10.1016/j.orl.2010.08.008
Publication status	Published - Nov 2010

Keywords

Round-robin tournaments
Sports
Break
Strength group

Access to Document

10.1016/j.orl.2010.08.008

Cite this

@article{aa919df75e7f45d4a1e0493f80d902ea,

title = "Constructing fair round robin tournaments with a minimum number of breaks",

abstract = "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.",

keywords = "Round-robin tournaments, Sports, Break, Strength group",

author = "{van 't Hof}, Pim and Gerhard Post and Dirk Briskorn",

note = "10.1016/j.orl.2010.08.008 ",

year = "2010",

month = nov,

doi = "10.1016/j.orl.2010.08.008",

language = "English",

volume = "38",

pages = "592--596",

journal = "Operations research letters",

issn = "0167-6377",

publisher = "Elsevier",

number = "6",

}

TY - JOUR

T1 - Constructing fair round robin tournaments with a minimum number of breaks

AU - van 't Hof, Pim

AU - Post, Gerhard

AU - Briskorn, Dirk

N1 - 10.1016/j.orl.2010.08.008

PY - 2010/11

Y1 - 2010/11

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

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

KW - Round-robin tournaments

KW - Sports

KW - Break

KW - Strength group

U2 - 10.1016/j.orl.2010.08.008

DO - 10.1016/j.orl.2010.08.008

M3 - Article

SN - 0167-6377

VL - 38

SP - 592

EP - 596

JO - Operations research letters

JF - Operations research letters

IS - 6

ER -

Constructing fair round robin tournaments with a minimum number of breaks

Abstract

Keywords

Access to Document

Fingerprint

Cite this