Orthogonal schedules in single round robin tournaments

Roel Lambers; Jop Briët; Viresh Patel; Frits Spieksma; Mehmet Akif Yıldız

doi:10.1016/j.orl.2023.08.002

Orthogonal schedules in single round robin tournaments

Roel Lambers (Corresponding author)
, Jop Briët
, Viresh Patel
, Frits Spieksma
, Mehmet Akif Yıldız

Combinatorial Optimization

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

1 Citation (Scopus)

51 Downloads (Pure)

Abstract

A measure for the flexibility of a Home-Away Pattern set (HAP-set) is the width. The width of a HAP-set equals the size of the largest set of schedules compatible with the HAP-set, for which no match is scheduled in the same round in any two schedules. We prove lower and upper bounds on the width, and identify HAP-sets with largest possible width when the number of teams is a power of 2.

Original language	English
Pages (from-to)	528-532
Number of pages	5
Journal	Operations Research Letters
Volume	51
Issue number	5
DOIs	https://doi.org/10.1016/j.orl.2023.08.002
Publication status	Published - Sept 2023

Bibliographical note

Funding Information:
This research is supported by NWO Gravitation Project NETWORKS, Grant Number 024.002.003 . Also, Yıldız was supported by a Marie Skłodowska-Curie Action from the EC (COFUND grant no. 945045 ).

Publisher Copyright:
© 2023 The Author(s)

Funding

This research is supported by NWO Gravitation Project NETWORKS, Grant Number 024.002.003 . Also, Yıldız was supported by a Marie Skłodowska-Curie Action from the EC (COFUND grant no. 945045 ).

Keywords

Orthogonal schedules
Sport scheduling
Tournament design

Access to Document

10.1016/j.orl.2023.08.002

1-s2.0-S016763772300130X-mainFinal published version, 278 KBLicence: CC BY

Cite this

@article{105c35e436fb473abada2abc386f2141,

title = "Orthogonal schedules in single round robin tournaments",

abstract = "A measure for the flexibility of a Home-Away Pattern set (HAP-set) is the width. The width of a HAP-set equals the size of the largest set of schedules compatible with the HAP-set, for which no match is scheduled in the same round in any two schedules. We prove lower and upper bounds on the width, and identify HAP-sets with largest possible width when the number of teams is a power of 2.",

keywords = "Orthogonal schedules, Sport scheduling, Tournament design",

author = "Roel Lambers and Jop Bri{\"e}t and Viresh Patel and Frits Spieksma and Yıldız, \{Mehmet Akif\}",

note = "Funding Information: This research is supported by NWO Gravitation Project NETWORKS, Grant Number 024.002.003 . Also, Yıldız was supported by a Marie Sk{\l}odowska-Curie Action from the EC (COFUND grant no. 945045 ). Publisher Copyright: {\textcopyright} 2023 The Author(s)",

year = "2023",

month = sep,

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

language = "English",

volume = "51",

pages = "528--532",

journal = "Operations Research Letters",

issn = "0167-6377",

publisher = "Elsevier B.V.",

number = "5",

}

TY - JOUR

T1 - Orthogonal schedules in single round robin tournaments

AU - Lambers, Roel

AU - Briët, Jop

AU - Patel, Viresh

AU - Spieksma, Frits

AU - Yıldız, Mehmet Akif

N1 - Funding Information: This research is supported by NWO Gravitation Project NETWORKS, Grant Number 024.002.003 . Also, Yıldız was supported by a Marie Skłodowska-Curie Action from the EC (COFUND grant no. 945045 ). Publisher Copyright: © 2023 The Author(s)

PY - 2023/9

Y1 - 2023/9

N2 - A measure for the flexibility of a Home-Away Pattern set (HAP-set) is the width. The width of a HAP-set equals the size of the largest set of schedules compatible with the HAP-set, for which no match is scheduled in the same round in any two schedules. We prove lower and upper bounds on the width, and identify HAP-sets with largest possible width when the number of teams is a power of 2.

AB - A measure for the flexibility of a Home-Away Pattern set (HAP-set) is the width. The width of a HAP-set equals the size of the largest set of schedules compatible with the HAP-set, for which no match is scheduled in the same round in any two schedules. We prove lower and upper bounds on the width, and identify HAP-sets with largest possible width when the number of teams is a power of 2.

KW - Orthogonal schedules

KW - Sport scheduling

KW - Tournament design

UR - https://www.scopus.com/pages/publications/85169546569

U2 - 10.1016/j.orl.2023.08.002

DO - 10.1016/j.orl.2023.08.002

M3 - Article

AN - SCOPUS:85169546569

SN - 0167-6377

VL - 51

SP - 528

EP - 532

JO - Operations Research Letters

JF - Operations Research Letters

IS - 5

ER -

Orthogonal schedules in single round robin tournaments

Abstract

Bibliographical note

Funding

Keywords

Access to Document

Other files and links

Fingerprint

Cite this