Distributed Bandits: Probabilistic Communication on d-regular Graphs
From MaRDI portal
Distributed Bandits: Probabilistic Communication on $d$-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 -regular graph. Every edge in the graph has probabilistic weight to account for the () 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 . 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.
This page was built for publication: Distributed Bandits: Probabilistic Communication on $d$-regular Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6353809)
