On the Borda-Kendall Consensus Method for Priority Ranking Problems
This paper investigates the Borda-Kendall method for the determination of a consensus ranking. It is shown that in the case of ties the method does not perform as claimed. A "minimum variance" method for determining the consensus ranking is proposed and its properties examined. It is shown to be equivalent to the Borda-Kendall method if ties are not allowed. An algorithm to determine the "minimum variance" consensus ranking in the case of ties is described. Results obtained from the solution of problems of various sizes are discussed.
Volume (Year): 28 (1982)
Issue (Month): 6 (June)
|Contact details of provider:|| Postal: 7240 Parkway Drive, Suite 300, Hanover, MD 21076 USA|
Web page: http://www.informs.org/
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:28:y:1982:i:6:p:621-637. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mirko Janc)
If references are entirely missing, you can add them using this form.