Analysis of large sets of ranking data

Various procedures, mainly graphical are presented for analyzing large sets of ranking data in which the permutations are not equally likely. One method is based on box plots, the others are motivated by a model originally proposed by Mallows. The model is characterised by two parameters corresponding to location and dispersion. Graphical methods based on Q-Q plots are also discussed for comparing two groups of judges. The proposed methods are illustrated on an empirical data set.