Ronald Fagin, Phokion G. Kolaitis, et al.
ACM TODS
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.
SEBD 2024
Moses Charikar, Ronald Fagin, et al.
Journal of Computer and System Sciences
Conference paper
Cell-probe lower bounds for the partial match problem
T.S. Jayram, Subhash Khot, et al.
STOC 2003