1 citations · 1 across the 4 of their papers we have counts for
4 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…
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…
Handling Sub-symmetry in Integer Programming using Activation Handlers
Christopher Hojny, Tom Verhoeff, Sten Wessel
Symmetry in integer programs (IPs) can be exploited in order to reduce solving times. Usually only symmetries of the original IP are handled, but new symmetries may arise at some n…