1 paper
Feng Li, Xuyang Yuan, Lina Wang +4
We consider a K-armed bandit problem in general graphs where agents are arbitrarily connected and each of them has limited memorizing capabilities and communication bandwidth. The…