Scheduling asynchronous round-robin tournaments

@article{Suksompong2016SchedulingAR,
  title={Scheduling asynchronous round-robin tournaments},
  author={Warut Suksompong},
  journal={ArXiv},
  year={2016},
  volume={abs/1804.04504}
}
  • W. Suksompong
  • Published 11 April 2018
  • Mathematics, Computer Science
  • ArXiv
We study the problem of scheduling asynchronous round-robin tournaments. We consider three measures of a schedule that concern the quality and fairness of a tournament. We show that the schedule generated by the well-known "circle design" performs well with respect to all three measures when the number of teams is even, but not when the number of teams is odd. We propose a different schedule that performs optimally with respect to all measures when the number of teams is odd. 
Minimization of rest mismatches in round robin tournaments
TLDR
The Rest Mismatch Problem is introduced and a heuristic algorithm is developed which finds a single round robin schedule with zero mismatches when the number of teams in the tournament is a multiple of 4 but not 8. Expand
Handling fairness issues in time-relaxed tournaments with availability constraints
TLDR
An adaptive large neighborhood method that repeatedly destroys and repairs a timetable, and a memetic algorithm that makes use of local search to schedule or reschedule all home games of a team are proposed. Expand
Relax-fix-optimize heuristics for time-relaxed sports timetabling
Abstract Time-relaxed sports timetables utilize (many) more time slots than there are games per team, and therefore offer the flexibility to take into account player and venue availability. However,Expand
Chapter 10 Fairness Trade-offs in Sports Timetabling
Any sports tournament needs a timetable, specifying which teams will meet at what time, and where. However, not all sport timetables are equally fair for the contestants. In this chapter, we discussExpand
Determining matchdays in sports league schedules to minimize rest differences
TLDR
This study focuses on the fairness criterion of minimizing the total rest difference among opposing teams to find the matchdays for an announced schedule, and shows that the problem is decomposable into optimizing the rounds separately. Expand
Who Can Win a Single-Elimination Tournament?
TLDR
It is proved new sufficient conditions on the pairwise match outcome information and the favorite player, under which there is guaranteed to be a seeding where the player wins the tournament. Expand
Determining the results of tournament games using complete graphs generation
TLDR
All possible results of the games involved in a football tournament are explored based on generating all the complete graphs which match the data in its final table by applying the table data of a qualifying group from previous FIFA World Cup Group Stages. Expand
Sport Tournament Automated Scheduling System
The organizer of sport events often facing problems such as wrong calculations of marks and scores, as well as difficult to create a good and reliable schedule. Most of the time, the issues about theExpand
Scheduling a non-professional indoor football league: a tabu search based approach
TLDR
An integer programming formulation and a heuristic based on tabu search are presented and it is shown that the heuristic generates schedules with a quality comparable to those found with IP solvers, however with considerably less computational effort. Expand
RobinX: A three-field classification and unified data format for round-robin sports timetabling
TLDR
RobinX is presented, a three-field notation to describe a sports timetabling problem by means of the tournament format, the constraints in use, and the objective that is used to classify sports timetables problems presented in the operations research literature during the last five decades. Expand
...
1
2
...

References

SHOWING 1-10 OF 14 REFERENCES
Constructing fair round robin tournaments with a minimum number of breaks
TLDR
It is shown 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. Expand
Constructing fair single round robin tournaments regarding strength groups with a minimum number of breaks
TLDR
A constructive method is presented to show the existence of group-balanced single round robin tournaments (SRRTs) with a minimum number of breaks, if the number of groups is a power of 2 with identical even group sizes. Expand
Round robin scheduling - a survey
TLDR
A comprehensive survey on the literature considering round robin tournaments, outlining the contributions presented during the last 30 years and discussing directions for future research within the area. Expand
Combinatorial properties of strength groups in round robin tournaments
TLDR
This paper proposes two concepts ensuring different degrees of fairness among teams, and analyzes the computational complexity of cost minimization problems in the presence of strength group requirements. Expand
Scheduling sports tournaments on a single court minimizing waiting times
  • S. Knust
  • Mathematics, Computer Science
  • Oper. Res. Lett.
  • 2008
We consider a sports tournament for an odd number of teams where every team plays exactly two matches in each round and all matches have to be scheduled consecutively on a single court. We constructExpand
Constructing fair sports league schedules with regard to strength groups
TLDR
This paper considers a partition of the teams into strength groups in order to establish fairness among teams, and picks up two concepts ensuring different degrees of fairness. Expand
Scheduling sports competitions with a given distribution of times
TLDR
In the absence of constraints imposed by particular teams, the problem is that of a balanced tournament design (BTD) and a new construction for BTDs with certain parameter values is presented. Expand
Fixing a Tournament
TLDR
The problem is NP-complete for general graphs and several interesting conditions on the desired winner A for which there exists a balanced single-elimination tournament which A wins, and it can be found in polynomial time. Expand
Who Can Win a Single-Elimination Tournament?
TLDR
It is proved new sufficient conditions on the pairwise match outcome information and the favorite player, under which there is guaranteed to be a seeding where the player wins the tournament. Expand
Combinatorial Designs and Tournaments
List of abbreviations 1. Introduction to basics 2. Difference methods 3. Symmetric designs 4. Orthogonal Latin squares 5. Self-orthogonal Latin squares 6. Steiner systems 7. Kirkman triple systems 8.Expand
...
1
2
...