{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T22:04:52Z","timestamp":1743026692148,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030863555"},{"type":"electronic","value":"9783030863562"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-86356-2_6","type":"book-chapter","created":{"date-parts":[[2021,12,11]],"date-time":"2021-12-11T13:02:41Z","timestamp":1639227761000},"page":"62-75","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Resource Allocation for Multi-source Multi-relay Wireless Networks: A\u00a0Multi-Armed Bandit Approach"],"prefix":"10.1007","author":[{"given":"Ali Al","family":"Khansa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raphael","family":"Visoz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yezekael","family":"Hayel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Samson","family":"Lasaulce","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,12,12]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Kramer, G., Mari\u0107, I., Yates, R.D.: Cooperative communications (2007)","DOI":"10.1561\/9781601980274"},{"issue":"9","key":"6_CR2","doi-asserted-by":"publisher","first-page":"3037","DOI":"10.1109\/TIT.2005.853304","volume":"51","author":"G Kramer","year":"2005","unstructured":"Kramer, G., Gastpar, M., Gupta, P.: Cooperative strategies and capacity theorems for relay networks. IEEE Trans. Inf. Theory 51(9), 3037\u20133063 (2005)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Sankaranarayanan, L., Kramer, G., Mandayam, N.B.: Hierarchical sensor networks: capacity bounds and cooperative strategies using the multiple-access relay channel model. In: 2004 First Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, SECON 2004, pp. 191\u2013199. IEEE (2004)","DOI":"10.1109\/SAHCN.2004.1381917"},{"key":"6_CR4","unstructured":"Laneman, J.N.: Cooperative diversity in wireless networks: algorithms and architectures. Ph.D. dissertation, Massachusetts Institute of Technology, Cambridge, MA (2002)"},{"issue":"5","key":"6_CR5","doi-asserted-by":"publisher","first-page":"3132","DOI":"10.1109\/TIT.2011.2119930","volume":"57","author":"SH Lim","year":"2011","unstructured":"Lim, S.H., Kim, Y.H., Gamal, A.E., Chung, S.Y.: Noisy network coding. IEEE Trans. Inf. Theory 57(5), 3132\u20133152 (2011)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"6_CR6","doi-asserted-by":"publisher","first-page":"1872","DOI":"10.1109\/TIT.2011.2110110","volume":"57","author":"AS Avestimehr","year":"2011","unstructured":"Avestimehr, A.S., Diggavi, S.N., Tse, D.N.C.: Wireless network information flow: a deterministic approach. IEEE Trans. Inf. Theory 57(4), 1872\u20131905 (2011)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"6_CR7","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1109\/TIT.1979.1056084","volume":"25","author":"T Cover","year":"1979","unstructured":"Cover, T., Gamal, A.E.: Capacity theorems for the relay channel. IEEE Trans. Inf. Theory 25(5), 572\u2013584 (1979)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"6_CR8","unstructured":"Khansa, A.A., Cerovic, S., Visoz, R., Hayel, Y., Lasaulce, S.: Slow-link adaptation algorithm for multi-source multi-relay wireless networks using best-response dynamics. To be presented at NetGCOOP (2021)"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Bubeck, S., Cesa-Bianchi, N.: Regret analysis of stochastic and nonstochastic multi-armed bandit problems. arXiv preprint arXiv:1204.5721 (2012)","DOI":"10.1561\/9781601986276"},{"issue":"1","key":"6_CR10","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1016\/0196-8858(85)90002-8","volume":"6","author":"TL Lai","year":"1985","unstructured":"Lai, T.L., Robbins, H.: Asymptotically efficient adaptive allocation rules. Adv. Appl. Math. 6(1), 4\u201322 (1985)","journal-title":"Adv. Appl. Math."},{"key":"6_CR11","unstructured":"Weng, L.: The multi-armed bandit problem and its solutions. lilianweng.github.io\/lil-log (2018)"},{"key":"6_CR12","unstructured":"Bubeck, S.: Bandits games and clustering foundations. Ph.D. dissertation, INRIA Nord Europe (2010)"},{"key":"6_CR13","unstructured":"Garivier, A., Capp\u00e9, O.: The KL-UCB algorithm for bounded stochastic bandits and beyond. In: Proceedings of the 24th Annual Conference on Learning Theory. In: JMLR Workshop and Conference Proceedings, pp. 359\u2013376 (2011)"},{"issue":"3\/4","key":"6_CR14","doi-asserted-by":"publisher","first-page":"285","DOI":"10.2307\/2332286","volume":"25","author":"WR Thompson","year":"1933","unstructured":"Thompson, W.R.: On the likelihood that one unknown probability exceeds another in view of the evidence of two samples. Biometrika 25(3\/4), 285\u2013294 (1933)","journal-title":"Biometrika"},{"key":"6_CR15","first-page":"2249","volume":"24","author":"O Chapelle","year":"2011","unstructured":"Chapelle, O., Li, L.: An empirical evaluation of Thompson sampling. Adv. Neural Inf. Process. Syst. 24, 2249\u20132257 (2011)","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"Russo, D., Van Roy, B., Kazerouni, A., Osband, I., Wen, Z.: A tutorial on Thompson sampling. arXiv preprint arXiv:1707.02038 (2017)","DOI":"10.1561\/9781680834710"},{"key":"6_CR17","unstructured":"Combes, R., Magureanu, S., Proutiere, A.: Minimal exploration in structured stochastic bandits. arXiv preprint arXiv:1711.00400 (2017)"},{"issue":"1","key":"6_CR18","doi-asserted-by":"publisher","first-page":"116","DOI":"10.3390\/s21010116","volume":"21","author":"WB Ameur","year":"2021","unstructured":"Ameur, W.B., Mary, P., H\u00e9lard, J.-F., Dumay, M., Schwoerer, J.: Autonomous power decision for the grant free access MUSA scheme in the mMTC scenario. Sensors 21(1), 116 (2021)","journal-title":"Sensors"},{"key":"6_CR19","doi-asserted-by":"crossref","unstructured":"Nasim, I., Ibrahim, A.S., Kim, S.: Learning-based beamforming for multi-user vehicular communications: a combinatorial multi-armed bandit approach. IEEE Access 8, 219 891\u2013219 902 (2020)","DOI":"10.1109\/ACCESS.2020.3043301"},{"key":"6_CR20","unstructured":"Chen, W., Wang, Y., Yuan, Y.: Combinatorial multi-armed bandit: general framework and applications. In: International Conference on Machine Learning. PMLR, pp. 151\u2013159 (2013)"},{"key":"6_CR21","doi-asserted-by":"crossref","unstructured":"Kuchibhotla, V., Harshitha, P., Elugoti, D.: Combinatorial sleeping bandits with fairness constraints and long-term non-availability of arms. In: 2020 4th International Conference on Electronics, Communication and Aerospace Technology (ICECA), pp. 1575\u20131581. IEEE (2020)","DOI":"10.1109\/ICECA49313.2020.9297371"},{"key":"6_CR22","doi-asserted-by":"crossref","unstructured":"Cerovic, S., Visoz, R., Madier, L., Berthet, A.O.: Centralized scheduling strategies for cooperative HARQ retransmissions in multi-source multi-relay wireless networks. In: Proceedings of IEEE ICC 2018, Kansas City, MO, USA, May 2018","DOI":"10.1109\/ICC.2018.8422578"},{"key":"6_CR23","doi-asserted-by":"crossref","unstructured":"Mohamad, A., Visoz, R., Berthet, A.O.: Outage analysis of various cooperative strategies for the multiple access multiple relay channel. In: IEEE 24th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC). IEEE 2013, pp. 1321\u20131326 (2013)","DOI":"10.1109\/PIMRC.2013.6666344"},{"issue":"2","key":"6_CR24","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.: Finite-time analysis of the multiarmed bandit problem. Mach. Learn. 47(2), 235\u2013256 (2002)","journal-title":"Mach. Learn."}],"container-title":["Lecture Notes in Computer Science","Ubiquitous Networking"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-86356-2_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,14]],"date-time":"2024-09-14T07:29:54Z","timestamp":1726298994000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-86356-2_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030863555","9783030863562"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-86356-2_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"12 December 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"UNet","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Ubiquitous Networking","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 May 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 May 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"unet2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/unet-conf.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EDAS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"38","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"16","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"42% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}