1 citations · 1 across the 2 of their papers we have counts for
1 paper · 1 filter
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…