Cooperative Multi-Agent Constrained Stochastic Linear Bandits

In this study, we explore a collaborative multi-agent stochastic linear bandit setting involving a network of N agents that communicate locally to minimize their collective regret while keeping their expected cost under a specified threshold τ. Each agent encounters a distinct linear bandit problem characterized by its own reward and cost parameters, i.e., local parameters. The goal of the agents is to determine the best overall action corresponding to the average of these parameters, or so-called global parameters. In each round, an agent is randomly chosen to select an action based on its current knowledge of the system. This chosen action is then executed by all agents, then they observe their individual rewards and costs. We propose a safe distributed upper confidence bound algorithm, so called textitMA-OPLB, and establish a high probability bound on its T-round regret. MA-OPLB utilizes an accelerated consensus method, where agents can compute an estimate of the average rewards and costs across the network by communicating the proper information with their neighbors. We show that our regret bound is of order Oleft(fracdτ-c0fraclog(NT)2√N√fracTlog(1/|λ2|)right), where λ2 is the second largest (in absolute value) eigenvalue of the communication matrix, and τ-c0 is the known cost gap of a feasible action. We also experimentally show the performance of our proposed algorithm in different network structures.