Article contents
The enumeration and bifurcations of ranking functions
Published online by Cambridge University Press: 17 April 2009
Abstract
Suppose n competitors each compete in r races and a ranking function F assigns a score F(j) to the competitor finishing in the jth position in each race. The sum of the scores over r races gives each competitor a final ranking. If n is fixed, the ranking function F bifurcates as r increases. The complete bifurcation behaviour is determined for n = 3 and some information obtained for n > 3.
- Type
- Research Article
- Information
- Copyright
- Copyright © Australian Mathematical Society 1978
References
- 1
- Cited by