On the Borda-Kendall Consensus Method for Priority Ranking Problems
研究了Borda-Kendall共识排序方法，指出其在处理并列排名时存在问题，并提出一种“最小方差”替代方法，该方法在无并列时与原方法等价，并给出了处理并列的算法。
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.