Rank Aggregation: Together We're Strong


We consider the problem of finding a ranking of a set of elements that is “closest to” a given set of input rankings of the elements; more precisely, we want to find a permutation that minimizes the Kendall-tau distance to the input rankings, where the Kendall-tau distance is defined as the sum over all input rankings of the number of pairs of elements that… (More)
DOI: 10.1137/1.9781611972894.4


3 Figures and Tables


Citations per Year

57 Citations

Semantic Scholar estimates that this publication has 57 citations based on the available data.

See our FAQ for additional information.