{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,27]],"date-time":"2025-08-27T05:10:20Z","timestamp":1756271420537,"version":"3.44.0"},"reference-count":30,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,5,26]],"date-time":"2025-05-26T00:00:00Z","timestamp":1748217600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,5,26]],"date-time":"2025-05-26T00:00:00Z","timestamp":1748217600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,5,26]]},"DOI":"10.23919\/wiopt66569.2025.11123300","type":"proceedings-article","created":{"date-parts":[[2025,8,26]],"date-time":"2025-08-26T19:04:05Z","timestamp":1756235045000},"page":"1-8","source":"Crossref","is-referenced-by-count":0,"title":["Adaptive Algorithms for Automatic Link Selection in Multiple Access with Link Failures"],"prefix":"10.23919","author":[{"given":"Mevan","family":"Wijewardena","sequence":"first","affiliation":[{"name":"University of Southern California,Dept. of Electrical and Computer Engineering,Los Angeles,USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael J.","family":"Neely","sequence":"additional","affiliation":[{"name":"University of Southern California,Dept. of Electrical and Computer Engineering,Los Angeles,USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2008.2004555"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/OJCOMS.2020.2969899"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1002\/ett.4460080106"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2600523"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/90.879343"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2008.4738709"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2010.5461911"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/S1389-1286(02)00401-2"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/18.212277"},{"key":"ref10","article-title":"Asymptotic properties of proportional-fair sharing algorithms","volume-title":"Proc. 40th Annual Allerton Conf. on Communication, Control, and Computing, Monticello, IL","author":"Kushner","year":"2002"},{"key":"ref11","article-title":"Optimality of certain channel aware scheduling policies","volume-title":"Proc. 40th Annual Allerton Conf. on Communication, Control, and Computing, Monticello, IL","author":"Agrawal","year":"2002"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2019.2914695"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2006.879361"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s11134-005-1450-0"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-79995-2"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1090\/pcms\/025\/03"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/2600057.2602844"},{"key":"ref18","article-title":"Contextual bandits with concave rewards, and an application to fair ranking","volume-title":"The Eleventh International Conference on Learning Representations","author":"Do","year":"2023"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2019.1840"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1995.492488"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177703591"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i6.20569"},{"key":"ref23","article-title":"Mirror Sinkhorn: fast online optimization on transport polytopes","volume-title":"Proceedings of the 40th International Conference on Machine Learning, ser. ICML\u201923","author":"Ballu","year":"2023"},{"key":"ref24","article-title":"Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration","author":"Altschuler","year":"2017","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref25","first-page":"138","article-title":"Adaptively tracking the best bandit arm with an unknown number of distribution changes","volume-title":"Proceedings of the Thirty-Second Conference on Learning Theory","volume":"99","author":"Auer","year":"2019"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.2139\/ssrn.3261050"},{"key":"ref27","first-page":"147","article-title":"Three observations on linear algebra","volume":"5","author":"Birkhoff","year":"1946","journal-title":"Univ. Nac. Tacuman, Rev. Ser. A"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2024.3374755"},{"volume-title":"Automatic link selection in multi-channel multiple access with link failures","year":"2025","author":"Wijewardena","key":"ref29"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/3392157"}],"event":{"name":"2025 23rd International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","start":{"date-parts":[[2025,5,26]]},"location":"Linkoping, Sweden","end":{"date-parts":[[2025,5,29]]}},"container-title":["2025 23rd International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11123177\/11123184\/11123300.pdf?arnumber=11123300","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,27]],"date-time":"2025-08-27T04:51:15Z","timestamp":1756270275000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11123300\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,26]]},"references-count":30,"URL":"https:\/\/doi.org\/10.23919\/wiopt66569.2025.11123300","relation":{},"subject":[],"published":{"date-parts":[[2025,5,26]]}}}