Multi-user lax communications: A multi-armed bandit approach
Authors:
- 1 April 2016
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-9
Abstract
Inspired by cognitive radio networks, we consider a setting where multiple users share several channels modeled as a multi-user multi-armed bandit (MAB) problem. The characteristics of each channel are unknown and are different for each user. Each user can choose between the channels, but her success depends on the particular channel chosen as well as on the selections of other users: if two users select the same channel their messages collide and none of them manages to send any data. Our setting is fully distributed, so there is no central control. As in many communication systems, the users cannot set up a direct communication protocol, so information exchange must be limited to a minimum. We develop an algorithm for learning a stable configuration for the multi-user MAB problem. We further offer both convergence guarantees and experiments inspired by real communication networks, including comparison to state-of-the-art algorithms.Keywords
All Related Versions
This publication has 19 references indexed in Scilit:
- Concurrent Bandits and Cognitive Radio Networks2014
- Game Theoretic Aspects of the Multi-Channel ALOHA Protocol in Cognitive Radio NetworksIEEE Journal on Selected Areas in Communications, 2013
- Multichannel Opportunistic Carrier Sensing for Stable Channel Access Control in Cognitive Radio SystemsIEEE Journal on Selected Areas in Communications, 2011
- Distributed Algorithms for Learning and Cognitive Medium Access with Logarithmic RegretIEEE Journal on Selected Areas in Communications, 2011
- Distributed Weighted Stable Marriage Problem2010
- Multi-armed bandit based policies for cognitive radio's decision making issues2009
- Almost Stable Matchings by Truncating the Gale–Shapley AlgorithmAlgorithmica, 2009
- A Note on Distributed Stable Matching2009
- The auction algorithm: A distributed relaxation method for the assignment problemAnnals of Operations Research, 1988
- College Admissions and the Stability of MarriageThe American Mathematical Monthly, 1962