Ronald Fagin, Phokion G. Kolaitis, et al.
Theoretical Computer Science
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
Soumen Chakrabarti, Byron E. Dom, et al.
Artificial Intelligence Review
Ronald Fagin, Joseph Y. Halpern
Journal of Philosophical Logic
Shuchi Chawla, Robert Krauthgamer, et al.
Computational Complexity