Solution of a Ranking Problem from Binary Comparisons
From MaRDI portal
Publication:3262647
DOI10.2307/2308513zbMath0089.15304OpenAlexW4254706681MaRDI QIDQ3262647
Publication date: 1958
Published in: The American Mathematical Monthly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2308513
Related Items (36)
Maximum likelihood estimation for incomplete multinomial data via the weaver algorithm ⋮ Incorporating within-pair order effects in the analytic hierarchy process ⋮ On negative dependence inequalities and maximal scores in round-robin tournaments ⋮ MM algorithms for generalized Bradley-Terry models. ⋮ Bradley–Terry modeling with multiple game outcomes with applications to College Hockey ⋮ Estimation of parameters of probabilistic models of binary and multiple comparisons ⋮ Estimation of the multi-criteria worths of the alternatives in a hierarchical structure of comparisons ⋮ Asymptotic theory of sparse Bradley-Terry model ⋮ Incomplete paired comparisons in case of multiple choice and general log-concave probability density functions ⋮ A General Pairwise Comparison Model for Extremely Sparse Networks ⋮ On ties in triple comparisons ⋮ Maximum likelihood estimation for Luce's choice model ⋮ BRADLEY–TERRY CHOICE PROBABILITY IN MAXIMUM LIKELIHOOD AND EIGENPROBLEM SOLUTIONS ⋮ Ranking participants in tournaments by means of rating functions ⋮ Paired comparisons analysis: an axiomatic approach to ranking methods ⋮ The categorical data analysis approach for ratio model of pairwise comparisons ⋮ Thurstone scaling via binary response regression ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Relationships between Borda voting and Zermelo ranking ⋮ Asymptotic enumeration of orientations of a graph as a function of the out-degree sequence ⋮ Ranking in the generalized Bradley–Terry models when the strong connection condition fails ⋮ A note on ranking in the Plackett-Luce model for multiple comparisons ⋮ Greedy-Like Algorithms for Dynamic Assortment Planning Under Multinomial Logit Preferences ⋮ Spectral method and regularized MLE are both optimal for top-\(K\) ranking ⋮ Asymptotics when the number of parameters tends to infinity in the Bradley-Terry model for paired comparisons ⋮ Pairwise marginal likelihood for the Bradley-Terry model ⋮ Resistance and conductance in structured Zermelo tournaments ⋮ A survey on the complexity of tournament solutions ⋮ Neighborhood monotonicity, the extended Zermelo model, and symmetric knockout tournaments ⋮ A stochastic model for paired comparisons of social stimuli ⋮ Deriving priorities from the Bradley-Terry model ⋮ Masking data: a solution to social desirability bias in paired comparison experiments ⋮ Are all linear paired comparison models empirically equivalent? ⋮ Inference in pairwise comparison experiments based on ratio scales ⋮ Models for paired comparison data: a review with emphasis on dependent data
This page was built for publication: Solution of a Ranking Problem from Binary Comparisons
