most citedSolving Bernoulli Rank-One Bandits with Unimodal Thompson Sampling

9 citations · 10 across the 2 of their papers we have counts for

collaborators
Showing cs.LGShow all

1 paper · 1 filter

cs.LG2021★ 1 cited

A High Performance, Low Complexity Algorithm for Multi-Player Bandits Without Collision Sensing Information

Cindy Trinh, Richard Combes

Motivated by applications in cognitive radio networks, we consider the decentralized multi-player multi-armed bandit problem, without collision nor sensing information. We propose…