Name
Abstract | ||
|---|---|---|
Motivated by cognitive radio networks, we consider the stochastic multiplayer multi-armed bandit problem, where several players pull arms simultaneously and collisions occur if one of them is pulled by several players at the same stage. We present a decentralized algorithm that achieves the same performance as a centralized one, contradicting the existing lower bounds for that problem. This is possible by "hacking" the standard model by constructing a communication protocol between players that deliberately enforces collisions, allowing them to share their information at a negligible cost. This motivates the introduction of a more appropriate dynamic setting without sensing, where similar communication protocols are no longer possible. However, we show that the logarithmic growth of the regret is still achievable for this model with a new algorithm. |
Year | Venue | Keywords |
|---|---|---|
2018 | neural information processing systems | communication protocol,cognitive radio networks,one of them,logarithmic growth |
Field | DocType | Volume |
Mathematical optimization,Synchronization,Regret,Logarithmic growth,Theoretical computer science,Hacker,Mathematics,Communications protocol,Cognitive radio | Journal | abs/1809.08151 |
Citations | PageRank | References |
1 | 0.36 | 13 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Boursier Etienne | 1 | 1 | 2.72 |
| Vianney Perchet | 2 | 132 | 25.23 |