Author:
Liu Zhengyang,Li Feng,Yu Dongxiao,Karl Holger,Sheng Hao
Publisher
Springer International Publishing
Reference17 articles.
1. Auer, P., Cesa-Bianchi, N., Fischer, P.: Finite-time analysis of the multiarmed bandit problem. Mach. Learn. 47(2–3), 235–256 (2002). https://doi.org/10.1023/A:1013689704352
2. Avner, O., Mannor, S.: Multi-user lax communications: a multi-armed bandit approach. In: Proceedings of the 35th IEEE INFOCOM, pp. 1–9 (2016)
3. Avrachenkov, K., Cottatellucci, L., Maggi, L.: Dynamic rate allocation in Markovian quasi-static multiple access channels: a game theoretic approach. In: Proceedings of the 11th WiOpt, pp. 162–169 (2013)
4. Besson, L., Kaufmann, E., Moy, C.: Aggregation of multi-armed bandits learning algorithms for opportunistic spectrum access. In: Proceedings of IEEE WCNC, pp. 1–6 (2018)
5. Cai, K., Liu, X., Chen, Y., Lui, J.C.S.: An online learning approach to network application optimization with guarantee. In: Proceedings of IEEE INFOCOM, pp. 2006–2014 (2018)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献