-
Synergistic Team Composition
Effective teams are crucial for organisations, especially in environment...
02/27/2017 ∙ by Ewa Andrejczuk, et al. ∙
0
∙
share
read it
-
TAIP: an anytime algorithm for allocating student teams to internship programs
In scenarios that require teamwork, we usually have at hand a variety of...
05/19/2020 ∙ by Athina Georgara, et al. ∙
0
∙
share
read it
-
The unfairness of the UEFA Euro 2020 qualifying
The qualification for the UEFA European Championship 2020 is strongly co...
05/08/2019 ∙ by László Csató, et al. ∙
0
∙
share
read it
-
The dominance of big teams in China's scientific output
Modern science is dominated by scientific productions from teams. A rece...
02/29/2020 ∙ by Linlin Liu, et al. ∙
0
∙
share
read it
-
Squirrel: A Switching Hyperparameter Optimizer
In this short note, we describe our submission to the NeurIPS 2020 BBO c...
12/15/2020 ∙ by Noor Awad, et al. ∙
26
∙
share
read it
-
Scheduling Bipartite Tournaments to Minimize Total Travel Distance
In many professional sports leagues, teams from opposing leagues/confere...
01/16/2014 ∙ by Richard Hoshino, et al. ∙
0
∙
share
read it
-
Why is the current seeding regime of the UEFA Champions League unfair?
Fairness has several interpretations in sports, one of them being that t...
12/14/2019 ∙ by László Csató, et al. ∙
0
∙
share
read it
A quest for a fair schedule: The Young Physicists' Tournament
06/03/2020 ∙ by Katarína Cechlárová, et al. ∙
0
∙
share
The Young Physicists Tournament is an established team-oriented scientific competition between high school students from 37 countries on 5 continents. The competition consists of scientific discussions called Fights. Three or four teams participate in each Fight, each of whom presents a problem while rotating the roles of Presenter, Opponent, Reviewer, and Observer among them. The rules of a few countries require that each team announce in advance 3 problems they will present at the national tournament. The task of the organizers is to choose the composition of Fights in such a way that each team presents each of its chosen problems exactly once and within a single Fight no problem is presented more than once. Besides formalizing these feasibility conditions, in this paper we formulate several additional fairness conditions for tournament schedules. We show that the fulfillment of some of them can be ensured by constructing suitable edge colorings in bipartite graphs. To find fair schedules, we propose integer linear programs and test them on real as well as randomly generated data.
READ FULL TEXT
Comments
There are no comments yet.