Comparison of Partially Ranked Lists

Abstract

In this paper we introduce a measure of closeness of partial rankings based on a metric on permutations, and we analyze some of its properties. We consider two types of partial rankings: ranking the k favorite items out of n and classification into several ordered categories.