Joseph Y. Halpern, Ronald Fagin
Distributed Computing
Paper
Comparing partial rankings
Abstract
We provide a comprehensive picture of how to compare partial rankings, that is, rankings that allow ties. We propose several metrics to compare partial rankings and prove that they are within constant multiples of each other. © 2006 Society for Industrial and Applied Mathematics.
Related
Tuǧkan Batu, Sanjoy Dasgupta, et al.
SIAM Journal on Computing
Marcelo Arenas, Ronald Fagin, et al.
Logical Methods in Computer Science
Ronald Fagin, Ryan Riegel, et al.
PNAS