Skip to main content

Computer Science > Information Theory

arXiv:1401.3093 (cs)
[Submitted on 14 Jan 2014]

Title:Rate-Distortion for Ranking with Incomplete Information

Authors:Farzad Farnoud (Hassanzadeh), Moshe Schwartz, Jehoshua Bruck
View PDF HTML (experimental)
Abstract:We study the rate-distortion relationship in the set of permutations endowed with the Kendall Tau 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 Tau 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.
Subjects: Information Theory (cs.IT)
Cite as: arXiv:1401.3093 [cs.IT]
  (or arXiv:1401.3093v1 [cs.IT] for this version)
  https://doi.org/10.48550/arXiv.1401.3093

Submission history

From: Farzad Farnoud (Hassanzadeh) [view email]
[v1] Tue, 14 Jan 2014 07:50:07 UTC (274 KB)
Full-text links:

Access Paper:

view license

Current browse context:

cs.IT
< prev   |   next >
new | recent | 2014-01
Change to browse by:
cs
math
math.IT

References & Citations

DBLP - CS Bibliography

listing | bibtex
Farzad Farnoud
Moshe Schwartz
Jehoshua Bruck

Bookmark

BibSonomy Reddit

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)