{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,7]],"date-time":"2026-07-07T06:17:27Z","timestamp":1783405047312,"version":"3.54.6"},"reference-count":39,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","license":[{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100002347","name":"Federal Ministry of Research, Technology and Space","doi-asserted-by":"crossref","award":["16KIS2411"],"award-info":[{"award-number":["16KIS2411"]}],"id":[{"id":"10.13039\/501100002347","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001659","name":"German Research Foundation","doi-asserted-by":"crossref","award":["MA7111\/6-1"],"award-info":[{"award-number":["MA7111\/6-1"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. on Mobile Comput."],"published-print":{"date-parts":[[2026,8]]},"DOI":"10.1109\/tmc.2026.3670034","type":"journal-article","created":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T20:54:43Z","timestamp":1772571283000},"page":"11741-11754","source":"Crossref","is-referenced-by-count":0,"title":["Service Placement in Small Cell Networks Using Distributed Best arm Identification in Linear Bandits"],"prefix":"10.1109","volume":"25","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-0481-337X","authenticated-orcid":false,"given":"Mariam","family":"Yahya","sequence":"first","affiliation":[{"name":"Department of Computer Science, University of Tübingen, Tübingen, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3511-2662","authenticated-orcid":false,"given":"Aydin","family":"Sezgin","sequence":"additional","affiliation":[{"name":"Faculty of Electrical Engineering and Information Technology, Ruhr-University Bochum, Bochum, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Setareh","family":"Maghsudi","sequence":"additional","affiliation":[{"name":"Faculty of Electrical Engineering and Information Technology, Ruhr-University Bochum, Bochum, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.23919\/EUSIPCO63237.2025.11226027"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2022.3220694"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2024.3414417"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.vehcom.2024.100860"},{"key":"ref5","article-title":"Ericsson mobility report","year":"2024"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1017\/9781316771655.005"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2022.3160738"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2019.8737560"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2019.2933781"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2025.3528492"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2020.3048613"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2019.2907605"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2018.2876823"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/PIMRC48278.2020.9217105"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1017\/9781108571401"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04414-4_7"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2023.3275851"},{"key":"ref18","first-page":"1","article-title":"Improved algorithms for linear stochastic bandits","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"24","author":"Abbasi-Yadkori","year":"2011"},{"key":"ref19","first-page":"41","article-title":"Best arm identification in multi-armed bandits","volume-title":"Proc. 23th Conf. Learn. Theory","author":"Audibert","year":"2010"},{"issue":"1","key":"ref20","first-page":"1","article-title":"On the complexity of best-arm identification in multi-armed bandit models","volume":"17","author":"Kaufmann","year":"2016","journal-title":"J. Mach. Learn. Res."},{"key":"ref21","first-page":"365","article-title":"On correlation and budget constraints in model-based bandit optimization with application to automatic machine learning","volume-title":"Proc. Artif. Intell. Statist.","author":"Hoffman","year":"2014"},{"key":"ref22","first-page":"1","article-title":"Best-arm identification in linear bandits","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"27","author":"Soare","year":"2014"},{"key":"ref23","first-page":"843","article-title":"A fully adaptive algorithm for pure exploration in linear bandits","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Xu","year":"2018"},{"key":"ref24","first-page":"1","article-title":"Distributed bandit learning: Near-optimal regret with efficient communication","volume-title":"Proc. Int. Conf. Learn. Representations 2020","author":"Wang","year":"2019"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i11.17156"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3338027"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.52202\/068431-0344"},{"key":"ref28","article-title":"Exploiting heterogeneity in robust federated best-arm identification","author":"Mitra","year":"2021"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2019.00017"},{"key":"ref30","first-page":"27057","article-title":"Federated linear contextual bandits","volume-title":"Proc. Adv. Neural Inf. Process. Sys.","volume":"34","author":"Huang","year":"2021"},{"key":"ref31","first-page":"691","article-title":"Distributed contextual linear bandits with minimax optimal communication cost","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Amani","year":"2023"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2024.3416833"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/WCSP.2017.8171043"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM48880.2022.9796714"},{"key":"ref35","first-page":"10007","article-title":"Optimal best-arm identification in linear bandits","volume-title":"Proc. Adv. Neural. Inf. Process. Syst.","volume":"33","author":"Jedra","year":"2020"},{"key":"ref36","first-page":"10384","article-title":"Choosing answers in epsilon-best-answer identification for linear bandits","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Jourdan","year":"2022"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i6.25823"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.52202\/068431-1350"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2018.2870521"}],"container-title":["IEEE Transactions on Mobile Computing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/7755\/11595771\/11419813.pdf?arnumber=11419813","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,7]],"date-time":"2026-07-07T05:34:47Z","timestamp":1783402487000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11419813\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8]]},"references-count":39,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/tmc.2026.3670034","relation":{},"ISSN":["1536-1233","1558-0660","2161-9875"],"issn-type":[{"value":"1536-1233","type":"print"},{"value":"1558-0660","type":"electronic"},{"value":"2161-9875","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,8]]}}}