Multiclass MinMax Rank Aggregation

01/28/2017

∙

by   Pan Li, et al.

∙

0

∙

share

We introduce a new family of minmax rank aggregation problems under two distance measures, the Kendall τ and the Spearman footrule. As the problems are NP-hard, we proceed to describe a number of constant-approximation algorithms for solving them. We conclude with illustrative applications of the aggregation methods on the Mallows model and genomic data.