Cardiff University | Prifysgol Caerdydd ORCA
Online Research @ Cardiff 
WelshClear Cookie - decide language by browser settings

Ranking players in multiple tournaments

Cook, W. D., Doyle, John R., Green, R. and Kress, M. 1996. Ranking players in multiple tournaments. Computers & Operations Research 23 (9) , pp. 869-880. 10.1016/0305-0548(95)00082-8

Full text not available from this repository.


This paper examines a generalization of the standard round robin tournament. First we consider a set of tournaments wherein each player competes in each member of the set, and the tournaments can be ordinally ranked in order of difficulty. The data envelopment analysis method is used to obtain a ranking for each player, while taking account not only of the players' strength within each tournament, but also the differential difficulty of tournaments. Second, we extend this concept to the case where each player may only compete in a subset of the tournaments. Hence, any given player may have fewer matches than other players.

Item Type: Article
Date Type: Publication
Status: Published
Schools: Business (Including Economics)
Subjects: H Social Sciences > H Social Sciences (General)
H Social Sciences > HA Statistics
Publisher: Elsevier
ISSN: 0305-0548
Last Modified: 05 Nov 2019 03:32

Citation Data

Cited 26 times in Google Scholar. View in Google Scholar

Cited 15 times in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item Edit Item