Maximum-likelihood paired comparison rankings
From MaRDI portal
Publication:5512580
DOI10.1093/biomet/53.1-2.143zbMath0138.13207OpenAlexW2026973988MaRDI QIDQ5512580
W. A. jun. Thompson, Russell jun. Remage
Publication date: 1966
Published in: Biometrika (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/biomet/53.1-2.143
Related Items
Some probabilistic properties of the nearest adjoining order method and its extensions, The reversing number of a digraph, A comparison between the prudent order and the ranking obtained with Borda's, Copeland's, Slater's and Kemeny's rules, New results on the computation of median orders, A survey on the linear ordering problem for weighted or unweighted tournaments, On solving intransitivities in repeated pairwise choices, Rankability and linear ordering problem: probabilistic insight and algorithms, Maximum distance between Slater orders and Copeland orders of tournaments, A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments, The median procedure in cluster analysis and social choice theory, Voting rules as statistical estimators, Ising formulations of some graph-theoretic problems in psychological research: models and methods, An updated survey on the linear ordering problem for weighted or unweighted tournaments, Median linear orders: Heuristics and a branch and bound algorithm, Measuring intransitivity