text: 425,194,1458442467011878917,186701821,Aldo Pacchiano,"(1/3 ) Happy to finally post this paper on arxiv! In this work we propose an algorithm with logarithmic instance dependent regret guarantees for the Multi-Player Multi-Armed bandit problem. <LINK> (2/3) Our results are based on two innovations. First, we show that a simple modification to a successive elimination strategy can be used by the players to estimate their suboptimality gaps, up to constant factors, in the absence of collisions. (3/3) Second, we leverage the first result to design a communication protocol that successfully uses the small reward of collisions to coordinate among players, while preserving meaningful instance-dependent logarithmic regret guarantees.",https://arxiv.org/abs/2111.04873,"We study the problem of information sharing and cooperation in Multi-Player Multi-Armed bandits. We propose the first algorithm that achieves logarithmic regret for this problem. Our results are based on two innovations. First, we show that a simple modification to a successive elimination strategy can be used to allow the players to estimate their suboptimality gaps, up to constant factors, in the absence of collisions. Second, we leverage the first result to design a communication protocol that successfully uses the small reward of collisions to coordinate among players, while preserving meaningful instance-dependent logarithmic regret guarantees. ","An Instance-Dependent Analysis for the Cooperative Multi-Player