Limitations of the MedRank algorithm

Abstract

Voting rules can be derived as distance minimization problems. Under quite restrictive conditions the MedRank algorithm minimizes the so-called Spearman footrule. We highlight the limitation of this result and also investigate the possibility of appropriate refinements of the MedRank algorithm. In addition, we show that the analogous problem does not arise when minimizing Spearman rank correlation, which results in the Borda count.