Joseph Y. Halpern, Ronald Fagin
Artificial Intelligence
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
J.Lawrence Carter, Ronald Fagin
Theoretical Computer Science
Ronald Fagin, Jurg Nievergelt, et al.
ACM Transactions on Database Systems (TODS)
Ronald Fagin, Joseph Y. Halpern, et al.
Annals of Pure and Applied Logic