Ronald Fagin, Moni Naor, et al.
Communications of the ACM
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
Ravi Kumar, Jasmine Novak, et al.
Communications of the ACM
Conference paper
A note on the set systems used for broadcast encryption
Ravi Kumar, Alexander Russell
SODA 1998
Conference paper
Normal forms and relational database operators
Ronald Fagin
SIGMOD 1979