Performance and Convergence of Multi-user Online Learning
We study the problem of allocating multiple users to a set of wireless channels in a decentralized manner when the channel qualities are time-varying and unknown to the users, and accessing the same channel by multiple users leads to reduced quality due to interference. In such a setting the users not only need to learn the inherent channel quality and at the same time the best allocations of users to channels so as to maximize the social welfare. Assuming that the users adopt a certain online learning algorithm, we investigate under what conditions the socially optimal allocation is achievable. In particular we examine the effect of different levels of knowledge the users may have and the amount of communications and cooperation. The general conclusion is that when the cooperation of users decreases and the uncertainty about channel payoffs increases it becomes harder to achieve the socially optimal allocation.
Keywordsmulti-user learning multi-armed bandits spectrum sharing congestion games
Unable to display preview. Download preview PDF.
- 2.Ahmad, S., Tekin, C., Liu, M., Southwell, R., Huang, J.: Spectrum Sharing as Spatial Congestion Games (2010), http://arxiv.org/abs/1011.5384
- 3.Anandkumar, A., Michael, N., Tang, A.: Opportunistic Spectrum Access with Multiple Players: Learning under Competition. In: Proc. of IEEE INFOCOM (March 2010)Google Scholar
- 4.Anantharam, V., Varaiya, P., Walrand, J.: Asymptotically Efficient Allocation Rules for the Multiarmed Bandit Problem with Multiple Plays-Part I: IID Rewards. IEEE Trans. Automat. Contr., 968–975 (November 1987)Google Scholar
- 5.Anantharam, V., Varaiya, P., Walrand, J.: Asymptotically Efficient Allocation Rules for the Multiarmed Bandit Problem with Multiple Plays-Part II: Markovian Rewards. IEEE Trans. Automat. Contr., 977–982 (November 1987)Google Scholar
- 11.Gai, Y., Krishnamachari, B., Jain, R.: Learning Multiuser Channel Allocations in Cognitive Radio Networks: a Combinatorial Multi-armed Bandit Formulation. In: IEEE Symp. on Dynamic Spectrum Access Networks (DySPAN) (April 2010)Google Scholar
- 12.Kakhbod, A., Teneketzis, D.: Power Allocation and Spectrum Sharing in Cognitive Radio Networks With Strategic Users. In: 49th IEEE Conference on Decision and Control (CDC) (December 2010)Google Scholar
- 13.Kasbekar, G., Proutiere, A.: Opportunustic Medium Access in Multi-channel Wireless Systems: A Learning Approach. In: Proceedings of the 48th Annual Allerton Conference on Communication, Control, and Computation (September 2010)Google Scholar
- 14.Kleinberg, R., Piliouras, G., Tardos, E.: Multiplicative Updates Outperform Generic No-Regret Learning in Congestion Games. In: Annual ACM Symposium on Theory of Computing, STOC (2009)Google Scholar
- 19.Sandholm, W.H.: Population Games and Evolutionary Dynamics (2008) (manuscript)Google Scholar
- 20.Smith, J.M.: Evolution and the Theory of Games. Cambridge University Press (1982)Google Scholar
- 21.Tekin, C., Liu, M.: Online Algorithms for the Multi-armed Bandit Problem with Markovian Rewards. In: Proceedings of the 48th Annual Allerton Conference on Communication, Control, and Computation (September 2010)Google Scholar
- 22.Tekin, C., Liu, M.: Online Learning in Opportunistic Spectrum Access: A Restless Bandit Approach. In: 30th IEEE International Conference on Computer Communications (INFOCOM) (April 2011)Google Scholar