6 citations · 11 across the 12 of their papers we have counts for
3 papers · 1 filter
Pure Exploration and Regret Minimization in Matching Bandits
Flore Sentenac, Jialin Yi, Clément Calauzènes +2
Finding an optimal matching in a weighted graph is a standard combinatorial problem. We consider its semi-bandit version where either a pair or a full matching is sampled sequentia…
Online Matching in Sparse Random Graphs: Non-Asymptotic Performances of Greedy Algorithm
Nathan Noiry, Flore Sentenac, Vianney Perchet
Motivated by sequential budgeted allocation problems, we investigate online matching problems where connections between vertices are not i.i.d., but they have fixed degree distribu…
Decentralized Learning in Online Queuing Systems
Flore Sentenac, Etienne Boursier, Vianney Perchet
Motivated by packet routing in computer networks, online queuing systems are composed of queues receiving packets at different rates. Repeatedly, they send packets to servers, each…