Research
A New Ranking Algorithm for A Round-Robin Tournament
Article
November 20, 2017
The problem of ranking players in a round- robin tournament, in which outcome of any match is a win or a loss, is to rank players according to their performances in the tournament. In this paper, we have improved previously developed MST (Majority Spanning Tree) algorithm for solving this problem, where the number of violations has been chosen as the criterion of optimality. We have compared the performance of our algorithm with the MST algorithm and GIK algorithm.
