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 | |
State | Published - Feb 1982 |
Keywords
- Dynamic programming
- Maximum likelihood
- Paired comparisons
- Ranking
ASJC Scopus subject areas
- Medicine (miscellaneous)