{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:23:22Z","timestamp":1740122602720,"version":"3.37.3"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,1,26]],"date-time":"2021-01-26T00:00:00Z","timestamp":1611619200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,26]],"date-time":"2021-01-26T00:00:00Z","timestamp":1611619200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Wireless Pers Commun"],"published-print":{"date-parts":[[2021,5]]},"DOI":"10.1007\/s11277-020-08064-w","type":"journal-article","created":{"date-parts":[[2021,1,27]],"date-time":"2021-01-27T05:02:34Z","timestamp":1611723754000},"page":"1165-1188","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Distributed Competitive Decision Making Using Multi-Armed Bandit Algorithms"],"prefix":"10.1007","volume":"118","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9106-4020","authenticated-orcid":false,"given":"Mahmoud","family":"Almasri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ali","family":"Mansour","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christophe","family":"Moy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ammar","family":"Assoum","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Denis","family":"Le Jeune","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christophe","family":"Osswald","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,1,26]]},"reference":[{"key":"8064_CR1","unstructured":"Marcus, M., Burtle, C. J., Franca, B., Lahjouji, A., & McNeil, N. (2002). Federal Communications Commission (FCC): Spectrum Policy Task Force. ET Docket, 02-135."},{"key":"8064_CR2","volume-title":"Learning from delayed rewards","author":"C Watkins","year":"1989","unstructured":"Watkins, C. (1989). Learning from delayed rewards. Cambridge: University of Cambridge."},{"key":"8064_CR3","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1016\/0196-8858(85)90002-8","volume":"6","author":"T Lai","year":"1985","unstructured":"Lai, T., & Robbins, H. (1985). Asymptotically efficient adaptive allocation rules. Advances in Applied Mathematics, 6, 4\u201322.","journal-title":"Advances in Applied Mathematics"},{"key":"8064_CR4","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1093\/biomet\/25.3-4.285","volume":"25","author":"WR Thompson","year":"1933","unstructured":"Thompson, W. R. (1933). On the likelihood that one unknown probability exceeds another in view of the evidence of two samples. Biometrika, 25, 285\u2013294.","journal-title":"Biometrika"},{"key":"8064_CR5","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1137\/S0097539701398375","volume":"32","author":"P Auer","year":"2002","unstructured":"Auer, P., Cesa-Bianchi, N., Freund, Y., & Schapire, R. (2002). The nonstochastic multiarmed bandit problem. SIAM Journal on Computing, 32, 48\u201377.","journal-title":"SIAM Journal on Computing"},{"key":"8064_CR6","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1023\/A:1013689704352","volume":"47","author":"P Auer","year":"2002","unstructured":"Auer, P., Cesa-Bianchi, N., & Fischer, P. (2002). Finite-time analysis of the multiarmed bandit problem. Machine Learning, 47, 235\u2013256.","journal-title":"Machine Learning"},{"key":"8064_CR7","unstructured":"Burtini, G., Loeppky, J., & Lawrence, R. (2015). A survey of online experiment design with the stochastic multi-armed bandit, arXiv preprint arXiv:1510.00757."},{"key":"8064_CR8","unstructured":"Kaufmann, E., Capp\u00e9, O., & Garivier, A. (2012). On Bayesian upper confidence bounds for bandit problems. In Artificial intelligence and statistics, La Palma, Canary Islands."},{"key":"8064_CR9","unstructured":"Maillard, O., Munos, R., & Stoltz, G. (2011). A finite-time analysis of multi-armed bandits problems with Kullback\u2013Leibler divergences. In Annual conference on learning theory, Budapest, Hungary."},{"key":"8064_CR10","doi-asserted-by":"publisher","first-page":"639","DOI":"10.1002\/asmb.874","volume":"26","author":"S Scott","year":"2010","unstructured":"Scott, S. (2010). A modern Bayesian look at the multi-armed bandit. Applied Stochastic Models in Business and Industry, 26, 639\u2013658.","journal-title":"Applied Stochastic Models in Business and Industry"},{"key":"8064_CR11","unstructured":"Chapelle, O., & Li, L. (2011). An empirical evaluation of Thompson sampling. In Advances in neural information processing systems, Granada, Spain."},{"key":"8064_CR12","doi-asserted-by":"crossref","unstructured":"Kaufmann, E., Korda, N., & Munos, R. (2012). Thompson sampling: An asymptotically optimal finite-time analysis. In International conference on algorithmic learning theory, Lyon, France.","DOI":"10.1007\/978-3-642-34106-9_18"},{"key":"8064_CR13","unstructured":"Agrawal, S., & Goyal, N. (2013). Further optimal regret bounds for Thompson sampling. In Artificial intelligence and statistics, Scottsdale, USA."},{"key":"8064_CR14","unstructured":"Agrawal, S., & Goyal, N. (2012). Analysis of Thompson sampling for the multi-armed bandit. In Annual conference on learning theory, Edinburgh, Scotland."},{"key":"8064_CR15","unstructured":"Gai, Y., & Krishnamachari, B. (2011). Decentralized online learning algorithms for opportunistic spectrum access. In Global communications conference, Texas, USA."},{"key":"8064_CR16","doi-asserted-by":"crossref","unstructured":"Torabi, N., Rostamzadeh, K., & Leung, V. C. (2012). Rank-optimal channel selection strategy in cognitive networks. In Global communications conference, California, USA.","DOI":"10.1109\/GLOCOM.2012.6503147"},{"key":"8064_CR17","unstructured":"Rosenski, J., Shamir, O., & Szlak, L. (2016). Multi-player bandits-a musical chairs approach. In International conference on machine learning, New York, USA."},{"key":"8064_CR18","doi-asserted-by":"crossref","unstructured":"Avner, O., & Mannor, S. (2014). Concurrent bandit and cognitive radio networks. In European conference on machine learning and principles and practice of knowledge discovery in databases, Nancy, France.","DOI":"10.1007\/978-3-662-44848-9_5"},{"key":"8064_CR19","doi-asserted-by":"crossref","unstructured":"Almasri, M., Mansour, A., Moy, C., Assoum, A., Osswald, C., & Lejeune, D. (2019). Distributed algorithm to learn OSA channels availability and enhance the transmission rate of secondary users. In International symposium on communications and information technologies, HoChiMinh, Vietnam.","DOI":"10.1109\/ISCIT.2019.8905171"},{"key":"8064_CR20","doi-asserted-by":"crossref","unstructured":"Almasri, M., Mansour, A., Moy, C., Assoum, A., Osswald, C., & Lejeune, D. (2018). Opportunistic spectrum access in cognitive radio for tactical network. In European conference on electrical engineering and computer science, Bern, Switzerland.","DOI":"10.1109\/EECS.2018.00116"},{"key":"8064_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TCCN.2017.2675901","volume":"3","author":"N Modi","year":"2017","unstructured":"Modi, N., Mary, P., & Moy, C. (2017). QoS driven channel selection algorithm for cognitive radio network: Multi-user multi-armed bandit approach. IEEE Transactions on Cognitive Communications and Networking, 3, 1\u20136.","journal-title":"IEEE Transactions on Cognitive Communications and Networking"},{"key":"8064_CR22","doi-asserted-by":"crossref","unstructured":"Tekin, C., & Liu, M. (2011). Online learning in opportunistic spectrum access: A restless bandit approach. In International conference on computer communications, Shanghai, China.","DOI":"10.1109\/INFCOM.2011.5935068"},{"issue":"2","key":"8064_CR23","first-page":"267","volume":"2","author":"A Cauchy","year":"1889","unstructured":"Cauchy, A. (1889). Sur la convergence des s\u00e9ries. Oeuvres completes S\u00e9r, 2(2), 267\u2013279.","journal-title":"Oeuvres completes S\u00e9r"},{"key":"8064_CR24","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1080\/01621459.1963.10500830","volume":"58","author":"W Hoeffding","year":"1963","unstructured":"Hoeffding, W. (1963). Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association, 58, 13\u201330.","journal-title":"Journal of the American Statistical Association"},{"key":"8064_CR25","doi-asserted-by":"crossref","unstructured":"Almasri, M., Mansour, A., Moy, C., Assoum, A., Osswald, C., & Lejeune, D. (2019). All-powerful learning algorithm for the priority access in cognitive network. In European signal processing conference, A Coru\u00f1a, Spain.","DOI":"10.23919\/EUSIPCO.2019.8903016"}],"container-title":["Wireless Personal Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11277-020-08064-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11277-020-08064-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11277-020-08064-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,21]],"date-time":"2021-04-21T19:26:52Z","timestamp":1619033212000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11277-020-08064-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,26]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,5]]}},"alternative-id":["8064"],"URL":"https:\/\/doi.org\/10.1007\/s11277-020-08064-w","relation":{},"ISSN":["0929-6212","1572-834X"],"issn-type":[{"type":"print","value":"0929-6212"},{"type":"electronic","value":"1572-834X"}],"subject":[],"published":{"date-parts":[[2021,1,26]]},"assertion":[{"value":"30 December 2020","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 January 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with Ethical Standards"}},{"value":"The authors declare that they have no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}