Open Access
Translator Disclaimer
May, 1976 A Note on Paired Comparison Rankings
Jagbir Singh
Ann. Statist. 4(3): 651-654 (May, 1976). DOI: 10.1214/aos/1176343474

Abstract

If $m$ objects $x_1, x_2, \cdots, x_m$ are compared pairwise, then let $s_{ij}$ denote the number of times $x_i$ beats $x_j$ in $n_{ij}$ independent comparisons. In a ranking, if $x_i$ precedes $x_j$ then one may require that the probability of $x_i$ beating $x_j$ be at least $\frac{1}{2}$. Such a ranking is called weak stochastic ranking. Let $I(R)$ be the set of all pairs $(i, j)$ such that $x_i$ precedes $x_j$ in the ranking $R$ in spite of the paired comparison outcomes resulting in $s_{ij} < s_{ji}$. A statistic $D(R) = \sum_{I(R)} (S_{ij} - S_{ji})^2/n_{ij}$ is derived and proposed for estimating a weak stochastic ranking. Since $D(R)$ is seen to be the sum of a random number of asymptotically distributed chi-square variates, a ranking is called minimum chi-square weak stochastic if $D(R) \leqq D(R_t)$, for $t = 1,2, \cdots, m$! It is proved that minimum chi-square rankings share at least two properties with the maximum likelihood rankings. That is, every minimum chi-square ranking is Hamiltonian ranking and when in particular $n_{ij} = 1$, every minimum chi-square ranking minimizes the violations of observed outcomes. Moreover, the branch and bound algorithm can be used for estimating the minimum chi-square rankings.

Citation

Download Citation

Jagbir Singh. "A Note on Paired Comparison Rankings." Ann. Statist. 4 (3) 651 - 654, May, 1976. https://doi.org/10.1214/aos/1176343474

Information

Published: May, 1976
First available in Project Euclid: 12 April 2007

zbMATH: 0344.62063
MathSciNet: MR413383
Digital Object Identifier: 10.1214/aos/1176343474

Subjects:
Primary: 62J15
Secondary: 62G05

Keywords: branch and bound algorithm , maximum likelihood and minimum chi-square rankings , Paired comparison rankings

Rights: Copyright © 1976 Institute of Mathematical Statistics

JOURNAL ARTICLE
4 PAGES


SHARE
Vol.4 • No. 3 • May, 1976
Back to Top