Papers
Communities
Events
Blog
Pricing
Search
Open menu
Home
Papers
2108.00230
Cited By
Pure Exploration and Regret Minimization in Matching Bandits
31 July 2021
Flore Sentenac
Jialin Yi
Clément Calauzènes
Vianney Perchet
Milan Vojnović
Re-assign community
ArXiv
PDF
HTML
Papers citing
"Pure Exploration and Regret Minimization in Matching Bandits"
3 / 3 papers shown
Title
Bandit Optimal Transport
Lorenzo Croissant
82
0
0
11 Feb 2025
UniRank: Unimodal Bandit Algorithm for Online Ranking
Camille-Sovanneary Gauthier
Romaric Gaudel
Elisa Fromont
26
2
0
02 Aug 2022
Unimodal Mono-Partite Matching in a Bandit Setting
Romaric Gaudel
Matthieu Rodet
36
0
0
02 Aug 2022
1