Ronald Fagin, Joseph Y. Halpern
Journal of Philosophical Logic
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, Phokion G. Kolaitis, et al.
SIGMOD/PODS/ 2004
Ronald Fagin, Joseph Y. Halpern, et al.
Artificial Intelligence
Conference paper
Towards a theory of schema-mapping optimization
Ronald Fagin, Phokion G. Kolaitis, et al.
SIGMOD/PODS/ 2008