A new algorithm for ranking players of a round-robin tournament

Scope and Purpose The problem of ranking players in a round-robin tournament is to rank players according to their performance in the tournament. Similar problem also arises in soliciting consumer preferences regarding a set of products and establishing funding priorities. In this paper we have developed a new heuristic algorithm where the number of violations has been chosen as the criterion of optimality. Experimental results suggest that this algorithm outperforms the existing ones in solving the ranking problem. Abstract In this paper we present a new algorithm for solving the problem of ranking players in a round-robin tournament in which outcome of any match is a win or a loss. We also compare performance of our algorithm with that of ARRANGE and GIK algorithms for solving the same problem. Some theoretical properties of our algorithm have also been deduced.