2000 character limit reached
Multi-User MABs with User Dependent Rewards for Uncoordinated Spectrum Access (1910.09091v3)
Published 21 Oct 2019 in cs.IT, cs.LG, cs.NI, math.IT, and stat.ML
Abstract: Multi-user multi-armed bandits have emerged as a good model for uncoordinated spectrum access problems. In this paper we consider the scenario where users cannot communicate with each other. In addition, the environment may appear differently to different users, ${i.e.}$, the mean rewards as observed by different users for the same channel may be different. With this setup, we present a policy that achieves a regret of $O (\log{T})$. This paper has been accepted at Asilomar Conference on Signals, Systems, and Computers 2019.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
