2022
UniRank: Unimodal Bandit Algorithms for Online Ranking
ICML 2022oral
We tackle, in the multiple-play bandit setting, the online ranking problem of assigning L items to K predefined positions on a web page in order to maximize the number of user clicks. We propose a generic algorithm, UniRank, that tackles state-of-the-art click models. The regret bound of this algori…