You are not currently logged in.
Access your personal account or get JSTOR access through your library or other institution:
If You Use a Screen ReaderThis content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Maximum Likelihood Paired Comparison Ranking by Linear Programming
John S. deCani
Vol. 56, No. 3 (Dec., 1969), pp. 537-545
Stable URL: http://www.jstor.org/stable/2334661
Page Count: 9
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Preview not available
The problem of ranking n objects from `best' to `worst', using the results of a paired comparison experiment, is formulated as a linear programming problem with the logarithm of the likelihood as the objective function. The constraints are determined by the transitivity relationships implied in a ranking. The linear program will determine maximum likelihood rankings for the k fold replicated paired comparison experiment with or without the possibility of ties. The method is demonstrated with two examples from recent literature.
Biometrika © 1969 Biometrika Trust