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

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.