AN ALGORITHM FOR MAXIMUM LIKELIHOOD RANKING AND SLATER'S i FROM PAIRED COMPARISONS
From MaRDI portal
Publication:4121337
DOI10.1111/j.2044-8317.1976.tb00715.xzbMath0351.62054OpenAlexW2120368496MaRDI QIDQ4121337
Publication date: 1976
Published in: British Journal of Mathematical and Statistical Psychology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/j.2044-8317.1976.tb00715.x
Linear programming (90C05) Paired and multiple comparisons; multiple testing (62J15) Applications of statistics to psychology (62P15)
Related Items
A note on the estimation of the Pareto efficient set for multiobjective matrix permutation problems ⋮ The median procedure in cluster analysis and social choice theory ⋮ Heuristic implementation of dynamic programming for matrix permutation problems in combinatorial data analysis ⋮ Pseudo-Boolean optimization