Ronald Fagin, Jonathan Lenchner, et al.
Logical Methods in Computer Science
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, Benny Kimelfeld, et al.
ACM TODS
Conference paper
Query strategies for priced information (extended abstract)
Moses Charikar, Ronald Fagin, et al.
STOC 2000
Miklos Ajtai, Randal Burns, et al.
Journal of the ACM