ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1806.02970
  4. Cited By
PAC Ranking from Pairwise and Listwise Queries: Lower Bounds and Upper
  Bounds

PAC Ranking from Pairwise and Listwise Queries: Lower Bounds and Upper Bounds

8 June 2018
Wenbo Ren
Jia-Wei Liu
Ness B. Shroff
ArXivPDFHTML

Papers citing "PAC Ranking from Pairwise and Listwise Queries: Lower Bounds and Upper Bounds"

2 / 2 papers shown
Title
A Nearly Instance Optimal Algorithm for Top-k Ranking under the
  Multinomial Logit Model
A Nearly Instance Optimal Algorithm for Top-k Ranking under the Multinomial Logit Model
Xi Chen
Yuanzhi Li
Jieming Mao
37
41
0
25 Jul 2017
Rank Centrality: Ranking from Pair-wise Comparisons
Rank Centrality: Ranking from Pair-wise Comparisons
S. Negahban
Sewoong Oh
Devavrat Shah
132
223
0
08 Sep 2012
1