Optimal Instance Adaptive Algorithm for the Top-K Ranking Problem

DOI10.1109/TIT.2018.2851986MaRDI QIDQ4682903zbMATH OpenOpenAlexFDO

Authors Xi Chen, Sivakanth Gopi, 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

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

Cited in

(1)

• Asymptotically Optimal Sequential Design for Rank Aggregation

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4682903)