An Improvement to MST Algorithm for Round-Robin Tournament Ranking
نویسندگان
چکیده
This paper improves the complexity of a newly introduced MST (Majority Spanning Tree) algorithm for ranking players of a round-robin tournament previously published.
منابع مشابه
A Modified Algorithm for Ranking Players of a Round-robin Tournament
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 ...
متن کاملStability Improvement of Hydraulic Turbine Regulating System Using Round-Robin Scheduling Algorithm
The sustainability of hydraulic turbines was one of the most important issues considered by electrical energy provider experts. Increased electromechanical oscillation damping is one of the key issues in the turbines sustainability. Electromechanical oscillations, if not quickly damp, can threaten the stability of hydraulic turbines and causes the separation of different parts of the netw...
متن کامل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 o...
متن کاملAn Evaluation of Ranking Methods for Multiple Incomplete Round-robin Tournaments
We investigate the ability of various methods to reveal the true ranking of players competing in multiple incomplete round-robin tournaments, which arise when not all tournament competitions are held. Statistical and graphical analyses in this simulation-based study reveal that a method based on players' average winning percentages is usually best.
متن کاملMinimizing the Carry-Over Effects Value in a Round-Robin Tournament
In this abstract, we deal with the problem of minimizing the carry-over effects value in a round-robin tournament. The carry-over effects value is an index of quality of a round-robin tournament schedule. We propose an effective algorithm for generating schedules of small carry-over effects values. The proposed algorithm produces better schedules than the previous best ones in short computation...
متن کامل