A computer program for maximum likelihood paired comparison rankings

Thomas G. Loflin; C. Alex McMahan

doi:10.1016/0010-468X(82)90088-5

A computer program for maximum likelihood paired comparison rankings

Thomas G. Loflin, C. Alex McMahan

Pathology

Research output: Contribution to journal › Article › peer-review

1 Scopus citations

Abstract

We describe a program for obtaining estimates of the rank order of objects in a paired comparison experiment. The program uses Remage and Thompson's dynamic programming algorithm [3] to obtain that ranking which maximizes the likelihood function with the restriction of weak stochastic transitivity.

Original language	English (US)
Pages (from-to)	47-52
Number of pages	6
Journal	Computer Programs in Biomedicine
Volume	14
Issue number	1
DOIs	https://doi.org/10.1016/0010-468X(82)90088-5
State	Published - Feb 1982

Keywords

Dynamic programming
Maximum likelihood
Paired comparisons
Ranking

ASJC Scopus subject areas

Medicine (miscellaneous)

Access to Document

10.1016/0010-468X(82)90088-5

Cite this

@article{07f91ba6a92c4b03bd4c4176b07df200,

title = "A computer program for maximum likelihood paired comparison rankings",

abstract = "We describe a program for obtaining estimates of the rank order of objects in a paired comparison experiment. The program uses Remage and Thompson's dynamic programming algorithm [3] to obtain that ranking which maximizes the likelihood function with the restriction of weak stochastic transitivity.",

keywords = "Dynamic programming, Maximum likelihood, Paired comparisons, Ranking",

author = "Loflin, {Thomas G.} and McMahan, {C. Alex}",

year = "1982",

month = feb,

doi = "10.1016/0010-468X(82)90088-5",

language = "English (US)",

volume = "14",

pages = "47--52",

journal = "Computer Methods and Programs in Biomedicine",

issn = "0169-2607",

publisher = "Elsevier Ireland Ltd",

number = "1",

}

TY - JOUR

T1 - A computer program for maximum likelihood paired comparison rankings

AU - Loflin, Thomas G.

AU - McMahan, C. Alex

PY - 1982/2

Y1 - 1982/2

N2 - We describe a program for obtaining estimates of the rank order of objects in a paired comparison experiment. The program uses Remage and Thompson's dynamic programming algorithm [3] to obtain that ranking which maximizes the likelihood function with the restriction of weak stochastic transitivity.

AB - We describe a program for obtaining estimates of the rank order of objects in a paired comparison experiment. The program uses Remage and Thompson's dynamic programming algorithm [3] to obtain that ranking which maximizes the likelihood function with the restriction of weak stochastic transitivity.

KW - Dynamic programming

KW - Maximum likelihood

KW - Paired comparisons

KW - Ranking

UR - http://www.scopus.com/inward/record.url?scp=0020069528&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0020069528&partnerID=8YFLogxK

U2 - 10.1016/0010-468X(82)90088-5

DO - 10.1016/0010-468X(82)90088-5

M3 - Article

C2 - 7067417

AN - SCOPUS:0020069528

VL - 14

SP - 47

EP - 52

JO - Computer Methods and Programs in Biomedicine

JF - Computer Methods and Programs in Biomedicine

SN - 0169-2607

IS - 1

ER -

A computer program for maximum likelihood paired comparison rankings

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this