1 paper
Romaric Gaudel, Matthieu Rodet
We tackle a new emerging problem, which is finding an optimal monopartite matching in a weighted graph. The semi-bandit version, where a full matching is sampled at each iteration,…