1 citations · 4 across the 9 of their papers we have counts for
11 papers
Finding Fair Draws for Incomplete Round Robin Tournaments
Sten Wessel, Frits Spieksma
In an incomplete round robin tournament, teams play against different sets of opponents. Given varying strengths of the teams, this raises a fairness issue. We establish the comple…
Fair Schedules for Single Round Robin Tournaments with Ranked Participants
Sten Wessel, Cor Hurkens, Frits Spieksma
We introduce a new measure to capture fairness of a schedule in a single round robin (SRR) tournament when participants are ranked by strength. To prevent distortion of the outcome…
Stable Approximation Algorithms for Dominating Set and Independent Set
Mark de Berg, Arpan Sadhukhan, Frits Spieksma
We study the Dominating set problem and Independent Set Problem for dynamic graphs in the vertex-arrival model. We say that a dynamic algorithm for one of these problems is -sta…
Fairness in Graph-Theoretical Optimization Problems
Christopher Hojny, Frits Spieksma, Sten Wessel
There is arbitrariness in optimum solutions of graph-theoretic problems that can give rise to unfairness. Incorporating fairness in such problems, however, can be done in multiple…
How to Design a Stable Serial Knockout Competition
Frits Spieksma, Rudi Pendavingh, Roel Lambers
We investigate a new tournament format that consists of a series of individual knockout tournaments; we call this new format a Serial Knockout Competition (SKC). This format has re…
Integer Programming Models for Round Robin Tournaments
Jasper van Doornmalen, Christopher Hojny, Roel Lambers +1
Round robin tournaments are omnipresent in sport competitions and beyond. We propose two new integer programming formulations for scheduling a round robin tournament, one of which…