Abstract | ||
---|---|---|
We study a decentralized cooperative multi-agent multi-armed bandit (MAB) problem with $K$ arms and $N$ agents connected over a network. In this model, each arm’s reward distribution is the same for every agent, and rewards are drawn independently across agents and over time steps. At each iteration, agents independently choose an arm to play and exchange at most $\mathsf {poly}(K)$ real-val... |
Year | DOI | Venue |
---|---|---|
2021 | 10.1109/JSAIT.2021.3080661 | IEEE Journal on Selected Areas in Information Theory |
Keywords | DocType | Volume |
Protocols,Bayes methods,Inference algorithms,Stochastic processes,Approximation algorithms,Network topology,Information theory | Journal | 2 |
Issue | Citations | PageRank |
2 | 0 | 0.34 |
References | Authors | |
0 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Anusha Lalitha | 1 | 0 | 0.68 |
Andrea Goldsmith | 2 | 0 | 0.34 |