Decentralized Multi-Armed Bandit Can Outperform Classic Upper Confidence Bound: A Homogeneous Case over Strongly Connected Graphs

Jingxuan Zhu, Ji Liu 0001. Decentralized Multi-Armed Bandit Can Outperform Classic Upper Confidence Bound: A Homogeneous Case over Strongly Connected Graphs. In 63rd IEEE Conference on Decision and Control, CDC 2024, Milan, Italy, December 16-19, 2024. pages 3133-3139, IEEE, 2024. [doi]

Abstract

Abstract is missing.