A Graph Theoretical Approach to Handicap Ranking of Tournaments and Paired Comparisons
Kenneth A. Berman · SIAM Journal on Algebraic and Discrete Methods · 1980
In this paper, the players in a tournament T are ranked according to the number of out arborescences rooted at the vertices of a digraph D associated with T. This ranking is shown to be equivalent to handicap ranking of tournaments. The tournaments considered in this paper may involve any number of games or no games between particular pairs of players and thus are more general than round-robin tournaments. In fact, these tournaments can be interpreted in statistics as systems of paired comparisons.