Joseph Y. Halpern, Ronald Fagin
PODC 1985
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
Two applications of information complexity
T.S. Jayram, Ravi Kumar, et al.
STOC 2003
Conference paper
Cell-probe lower bounds for the partial match problem
T.S. Jayram, Subhash Khot, et al.
STOC 2003
Ronald Fagin, Ravi Kumar, et al.
SIGMOD 2003