![Sample our Mathematics & Statistics journals, sign in here to start your FREE access for 14 days]({"type":"image" , "src" : "/sda/5943/TOC-Subject-Sample-2021-Mathematics-Statistics.jpg"})
The problem of ranking players in a round-robin tournament, in which the outcome of any match is a win or a loss, is to rank them according to their performances in the tournament. In this paper we have improved the previously developed majority spanning tree (MST) algorithm for solving this problem, where the number of violations has been chosen as the criterion of optimality. The performance of our algorithm is compared with that of the MST algorithm.
Acknowledgements
The authors wish to thank the anonymous referees for their valuable comments.