![](https://groups.cs.umass.edu/equate-ml/wp-content/uploads/sites/46/2022/04/Yang1-350x239.png)
This paper studies a cooperative multi-armed bandit problem with M agents cooperating together to solve the same instance of a K-armed stochastic bandit problem. The agents are heterogeneous in their limited access to a local subset of arms; and their decision-making rounds. The goal is to find the global optimal arm and agents are able … Continue reading "Paper: Cooperative Stochastic Bandits with Asynchronous Agents and Constrained Feedback"
Read More