most citedCooperative and Stochastic Multi-Player Multi-Armed Bandit: Optimal Regret With Neither Communication Nor Collisions

4 citations · 4 across the 3 of their papers we have counts for

collaborators

5 papers

math.PR2020

Local limits of bipartite maps with prescribed face degrees in high genus

Thomas Budzinski, Baptiste Louf

We study the local limits of uniform high genus bipartite maps with prescribed face degrees. We prove the convergence towards a family of infinite maps of the plane, the q-IBPMs, w…

cs.LG20204 cited

Cooperative and Stochastic Multi-Player Multi-Armed Bandit: Optimal Regret With Neither Communication Nor Collisions

Sébastien Bubeck, Thomas Budzinski, Mark Sellke

We consider the cooperative multi-player version of the stochastic multi-armed bandit problem. We study the regime where the players cannot communicate but have access to shared ra…

cs.GT2020

Coordination without communication: optimal regret in two players multi-armed bandits

Sébastien Bubeck, Thomas Budzinski

We consider two agents playing simultaneously the same stochastic three-armed bandit problem. The two agents are cooperating but they cannot communicate. We propose a strategy with…

math.PR2019

Recurrence of the Uniform Infinite Half-Plane Map via duality of resistances

Thomas Budzinski, Thomas Lehéricy

We study the simple random walk on the Uniform Infinite Half-Plane Map, which is the local limit of critical Boltzmann planar maps with a large and simple boundary. We prove that t…

math.PR2019

Universality for random surfaces in unconstrained genus

Thomas Budzinski, Nicolas Curien, Bram Petri

Starting from an arbitrary sequence of polygons whose total perimeter is , we can build an (oriented) surface by pairing their sides in a uniform fashion. Chmutov and Pittel (a…