22 citations · 48 across the 18 of their papers we have counts for
1 paper · 2 filters
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…