๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A Branch Search Algorithm for Maximum Likelihood Paired Comparison Ranking

โœ Scribed by John A. Flueck and James F. Korsh

Book ID
124279862
Publisher
Oxford University Press
Year
1974
Tongue
English
Weight
547 KB
Volume
61
Category
Article
ISSN
0006-3444

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A computer program for maximum likelihoo
A computer program for maximum likelihood paired comparison rankings
โœ Thomas G. Loflin; C.Alex McMahan ๐Ÿ“‚ Article ๐Ÿ“… 1982 ๐Ÿ› Elsevier Science โš– 437 KB

We describe a program for obtaining esttmates of the rank order of objects in a paired comparison experiment. The prolvam uses Rcmage and Thompson's dynamic programming algorithm [3] to obtain that rank,ng which maximize.~ the likelihood function with the restriction of weak stochastic transitivity.