Scheduling partial round robin tournaments subject to home away pattern sets
type: Item
instance of: scholarly article
title: Scheduling partial round robin tournaments subject to home away pattern sets
zbMATH Open document ID: 1166.90009
author: Kenji Kashiwabara
published in: The Electronic Journal of Combinatorics
publication date: 2009-07-08T00:00:00Z
full work available at URL: https://eudml.org/doc/130399
full work available at URL: v16i1r55.html
review text: In this paper a sports league scheduling problem is studied from a theoretical point of view. The objective is to find a round robin tournament schedule for \(2n\) teams and \(2n-1\) rounds where each team plays against each other team exactly once and every team plays one match per round. Additionally, a given home-away pattern set has to be respected which determines for every team and every round whether the team has to play home or away in that round. For the question whether a feasible schedule exists which is compatible with the given HAP set necessary conditions were proposed by \textit{D. Briskorn} [Oper. Res. Lett. 36, No. 3, 283--284 (2008; Zbl 1142.91364)], who conjectured that they are also sufficient. In this paper this conjecture is rewritten in terms of perfect matchings. By studying the Hilbert basis of a monoid in the affine space generated by perfect matchings the problem is generalized to situations where not all teams play against each other. It is shown that for this more general situation the conjecture is false, but holds for specially structured graphs.
reviewed by: Sigrid Knust
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 5576436
zbMATH Keywords: sports scheduling
zbMATH Keywords: round robin tournament
zbMATH Keywords: perfect matching
zbMATH Keywords: Hilbert basis
MaRDI profile type: Publication
Recommended article: Feasibility of home-away-pattern sets for round robin tournaments
Recommended article: The flexibility of home away pattern sets
Recommended article: Some models of graphs for scheduling sports competitions
Recommended article: Balanced home-away assignments
Recommended article: On the organization of round robin tournaments with constraints
Recommended article: On the multiplication of divisions: The use of graphs for sports scheduling
Recommended article: A branching scheme for finding cost-minimal round robin tournaments
Recommended article: Sports leagues scheduling. Models, combinatorial properties, and optimization algorithms.
Recommended article: Minimizing costs in round robin tournaments with place constraints
description: scientific article; zbMATH DE number 5576436