Premium
AN ALGORITHM FOR MAXIMUM LIKELIHOOD RANKING AND SLATER'S i FROM PAIRED COMPARISONS
Author(s) -
Ranyard Robert H.
Publication year - 1976
Publication title -
british journal of mathematical and statistical psychology
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 3.157
H-Index - 51
eISSN - 2044-8317
pISSN - 0007-1102
DOI - 10.1111/j.2044-8317.1976.tb00715.x
Subject(s) - ranking (information retrieval) , linear programming , mathematics , binary number , algorithm , replicate , computer science , statistics , artificial intelligence , arithmetic
The linear programming solution of the maximum likelihood ranking from paired comparisons problem, due to DeCani (1969), is considered. It is noted that Boolean methods exist for the solution of linear programmes in binary variables. The pseudo‐Boolean programming method of Hammer & Rudeanu (1968) is applied to DeCani's formulation and also to the problem of finding Slater's i. It is suggested that the algorithm is usually efficient for k ‐replicated paired comparisons data but not for the single replicate experiment.