We model individual careers in sports and games from initial entry to eventual exit or success as a discrete-choice, finite-horizon optimization problem. We apply this model to the international game of chess and study cross-country differences in the relative success of players. While we find...

A single round robin tournament (SRRT) consists of n teams and a set of periods. Matches between the teams have to be scheduled such that each team plays against each other team exactly once and each team plays at most once per period. In order to establish fairness among teams we consider a...

We introduce a new class of valid inequalities for the maximum round robin tournament (MRRT) problem. They strengthen the linear relaxation and improve the upper bound. We also answer negatively the question of Briskorn if the optimal objective value of the MRRT problem and that of its...

Generating a regular season schedule is a demanding task for any sports league. In Europe, the creation of a suitable schedule for every national top soccer league not only has to address numerous conflicting inner-league requirements and preferences. Additionally, the games of the European Cup...

In general scheduling a sports league is a difficult combinatorial optimization problem. We study some variants of round robin tournaments and analyze the relationship with the planar three index assignment problem. The complexity of scheduling a round robin tournaments is settled by a reduction...

A single round robin tournament can be described as a league of a set T of n teams (n even) to be scheduled such that each team plays exactly once against each other team and such that each team plays exactly once per period resulting in a set P of n — 1 periods. Matches are carried out at one...

Generally speaking in sports competition a number of teams play against each other over a period of time according to a certain scheme. The round robin scheme is very popular in many team sports like soccer and basketball. In this paper we study several basic variants of round robin tournaments....

When scheduling a round robin tournament (RRT) a Home-Away-Pattern (HAP) set defines for each team i and each period p whether i plays at home or away in p. So far the complexity of the decision problem whether a RRT can be arranged based on a given HAP set or not is open. We give a necessary...