Optimal Instance Adaptive Algorithm for the Top-$K$ Ranking Problem

DOI10.1109/TIT.2018.2851986zbMath1401.68285OpenAlexW2811380916MaRDI QIDQ4682903

Sivakanth Gopi, Xi Chen, Jieming Mao, Jon Schneider

Publication date: 19 September 2018

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2018.2851986

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (1)

Asymptotically Optimal Sequential Design for Rank Aggregation

This page was built for publication: Optimal Instance Adaptive Algorithm for the Top-$K$ Ranking Problem