29
4
v1v2 (latest)

Distributed Bandits: Probabilistic Communication on dd-regular Graphs

Abstract

We study the decentralized multi-agent multi-armed bandit problem for agents that communicate with probability over a network defined by a dd-regular graph. Every edge in the graph has probabilistic weight pp to account for the (1 ⁣ ⁣p1\!-\!p) probability of a communication link failure. At each time step, each agent chooses an arm and receives a numerical reward associated with the chosen arm. After each choice, each agent observes the last obtained reward of each of its neighbors with probability pp. We propose a new Upper Confidence Bound (UCB) based algorithm and analyze how agent-based strategies contribute to minimizing group regret in this probabilistic communication setting. We provide theoretical guarantees that our algorithm outperforms state-of-the-art algorithms. We illustrate our results and validate the theoretical claims using numerical simulations.

View on arXiv
Comments on this paper

We use cookies and other tracking technologies to improve your browsing experience on our website, to show you personalized content and targeted ads, to analyze our website traffic, and to understand where our visitors are coming from. See our policy.