Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published January 28, 2014 | Accepted Version
Report Open

Rate-Distortion for Ranking with Incomplete Information

Abstract

We study the rate-distortion relationship in the set of permutations endowed with the Kendall t-metric and the Chebyshev metric. Our study is motivated by the application of permutation rate-distortion to the average-case and worst-case analysis of algorithms for ranking with incomplete information and approximate sorting algorithms. For the Kendall t-metric we provide bounds for small, medium, and large distortion regimes, while for the Chebyshev metric we present bounds that are valid for all distortions and are especially accurate for small distortions. In addition, for the Chebyshev metric, we provide a construction for covering codes.

Attached Files

Accepted Version - etr125.pdf

Files

etr125.pdf
Files (213.0 kB)
Name Size Download all
md5:77ecaddf1dee67c0f96be130ad87c89a
213.0 kB Preview Download

Additional details

Created:
August 19, 2023
Modified:
October 25, 2023