Moses Charikar, Ronald Fagin, et al.
Journal of Computer and System Sciences
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
Conference paper
A declarative framework for linking entities
Douglas Burdick, Ronald Fagin, et al.
ICDT 2015
Ronald Fagin, Joseph Y. Halpern, et al.
Annals of Pure and Applied Logic
Ronald Fagin, Ravi Kumar, et al.
SIAM Journal on Discrete Mathematics