Competitive analysis of the top-K ranking problem

  title={Competitive analysis of the top-K ranking problem},
  author={Xi Chen and Sivakanth Gopi and Jieming Mao and Jon Schneider},
Motivated by applications in recommender systems, web search, social choice and crowdsourcing, we consider the problem of identifying the set of top K items from noisy pairwise comparisons. In our setting, we are non-actively given r pairwise comparisons between each pair of n items, where each comparison has noise constrained by a very general noise model called the strong stochastic transitivity (SST) model. We analyze the competitive ratio of algorithms for the top-K problem. In particular… CONTINUE READING
Recent Discussions
This paper has been referenced on Twitter 13 times over the past 90 days. VIEW TWEETS
7 Citations
26 References
Similar Papers

Similar Papers

Loading similar papers…