Scheduling asynchronous round-robin tournaments

@article{Suksompong2016SchedulingAR,
  title={Scheduling asynchronous round-robin tournaments},
  author={Warut Suksompong},
  journal={ArXiv},
  year={2016},
  volume={abs/1804.04504}
}

Figures and Tables from this paper

A quest for a fair schedule: The Young Physicists' Tournament

Several additional fairness conditions for tournament schedules are formulated and it is shown that the fulfillment of some of them can be ensured by constructing suitable edge colorings in bipartite graphs.

A quest for a fair schedule: The International Young Physicists’ Tournament

The International Young Physicists’ Tournament is an established team-oriented scientific competition between high school students from 37 countries on 5 continents. The competition consists of

Relax-fix-optimize heuristics for time-relaxed sports timetabling

This work proposes relax- and-fix (R&F) and fix-and-optimize (F&O) heuristics that make use of team- and time-based variable partitioning schemes that generate high-quality timetables using only a fraction of the computational resources used by monolithic integer programming solvers.

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 discuss

Who Can Win a Single-Elimination Tournament?

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.

Strategies for dealing with uncertainty in time-relaxed sports timetabling

This study uses three quality measures to evaluate the time-relaxed timetables, namely, the games played difference index, the rest difference index and the number of cancelled games.

Determining the results of tournament games using complete graphs generation

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.

References

SHOWING 1-10 OF 14 REFERENCES

Constructing fair round robin tournaments with a minimum number of breaks

Round robin scheduling - a survey

Combinatorial properties of strength groups in round robin tournaments

Scheduling sports tournaments on a single court minimizing waiting times

Constructing fair sports league schedules with regard to strength groups

Scheduling sports competitions with a given distribution of times

Fixing a Tournament

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.

Who Can Win a Single-Elimination Tournament?

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.

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.