118 citations · 405 across the 29 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
cs.LO2020
Solving Random Parity Games in Polynomial Time
Richard Combes, Mikael Touati
We consider the problem of solving random parity games. We prove that parity games exibit a phase transition threshold above , so that when the degree of the graph that define…
stat.ML2020
Statistically Efficient, Polynomial Time Algorithms for Combinatorial Semi Bandits
Thibaut Cuvelier, Richard Combes, Eric Gourdin
We consider combinatorial semi-bandits over a set of arms where rewards are uncorrelated across items. For this problem, the algorithm ESCB yields the…