  Scheduling a sports tournament is a complex optimization problem, which
requires a large number of hard constraints to satisfy. Despite the
availability of several such constraints in the literature, there remains a gap
since most of the new sports events pose their own unique set of requirements,
and demand novel constraints. Specifically talking of the strictly time bound
events, ensuring fairness between the different teams in terms of their rest
days, traveling, and the number of successive games they play, becomes a
difficult task to resolve, and demands attention. In this work, we present a
similar situation with a recently played sports event, where a suboptimal
schedule favored some of the sides more than the others. We introduce various
competitive parameters to draw a fairness comparison between the sides and
propose a weighting criterion to point out the sides that enjoyed this schedule
more than the others. Furthermore, we use root mean squared error between an
ideal schedule and the actual ones for each side to determine unfairness in the
distribution of rest days across their entire schedules. The latter is crucial,
since successively playing a large number of games may lead to sportsmen
burnout, which must be prevented.
