An improved MST algorithm for ranking players of a round-robin tournament

Authors:
Avijit Datta;Moazzem Hossain;M. Kaykobad
Affiliations:
Department of Computer Science and Engineering, Bangladesh University of Engineering and Technology, Dhaka, Bangladesh;Department of Computer Science and Engineering, Bangladesh University of Engineering and Technology, Dhaka, Bangladesh;Department of Computer Science and Engineering, Bangladesh University of Engineering and Technology, Dhaka, Bangladesh
Venue:
International Journal of Computer Mathematics
Year:
2008

Citing 5
Cited 0

On a minimum violations ranking of a tournament

Management Science
Heuristics for ranking players in a round robin tournament

Computers and Operations Research
Tournament ranking with expected profit in polynomial time

SIAM Journal on Discrete Mathematics
A new algorithm for ranking players of a round-robin tournament

Computers and Operations Research
Constructive Quasi-Ramsey Numbers and Tournament Ranking

SIAM Journal on Discrete Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.