12 citations · 33 across the 9 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2017★ 4 cited
A Nearly Instance Optimal Algorithm for Top-k Ranking under the Multinomial Logit Model
Xi Chen, Yuanzhi Li, Jieming Mao
We study the active learning problem of top- ranking from multi-wise comparisons under the popular multinomial logit model. Our goal is to identify the top- items with high p…
cs.DS2016
Competitive analysis of the top-K ranking problem
Xi Chen, Sivakanth Gopi, Jieming Mao +1
Motivated by applications in recommender systems, web search, social choice and crowdsourcing, we consider the problem of identifying the set of top items from noisy pairwise c…