Multi-player Multi-armed Bandits with Delayed Feedback
Lists
Only you see this
Abstract
Multi-player multi-armed bandits have been researched for a long time due to their application in cognitive radio networks. In this setting, multiple players select arms at each time and instantly receive the feedback. Most research on this problem focuses on the content of the immediate feedback, whether it includes both the reward and collision information or the reward alone. However, delay is common in cognitive networks when users perform spectrum sensing. In this paper, we design an algorithm DDSE (Decentralized Delayed Successive Elimination) in multi-player multi-armed bandits with stochastic delay feedback and establish a regret bound. Compared with existing algorithms that fail to address this problem, our algorithm enables players to adapt to delayed feedback and avoid collision. We also derive a lower bound in centralized setting to prove the algorithm achieves near-optimal. Numerical experiments on both synthetic and real-world datasets validate the effectiveness of our algorithm.
BibTeX
@inproceedings{fan2025multi,
author = {Jingqi Fan and Zilong Wang and Shuai Li and Linghe Kong},
title = {{Multi-player Multi-armed Bandits with Delayed Feedback}},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2025},
doi = {10.24963/ijcai.2025/564},
}Loading related content...