Ronald Fagin, Alan Nash
Journal of the ACM
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
Ronald Fagin, Joseph Y. Halpern, et al.
Annals of Pure and Applied Logic
Douglas Burdick, Ronald Fagin, et al.
JCSS
Conference paper
Inverting schema mappings
Ronald Fagin
SIGMOD/PODS/ 2006