Ziv Bar-Yossef, T.S. Jayram, et al.
Proceedings of the Annual IEEE Conference on Computational Complexity
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.
Ziv Bar-Yossef, T.S. Jayram, et al.
Proceedings of the Annual IEEE Conference on Computational Complexity
Moses Charikar, Ronald Fagin, et al.
Journal of Computer and System Sciences
Ronald Fagin
ACM TODS
Ronald Fagin, Jonathan Lenchner, et al.
LICS 2021