{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,24]],"date-time":"2026-06-24T06:46:41Z","timestamp":1782283601305,"version":"3.54.5"},"reference-count":24,"publisher":"IEEE","license":[{"start":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T00:00:00Z","timestamp":1780444800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T00:00:00Z","timestamp":1780444800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100016311","name":"Arm","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100016311","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026,6,3]]},"DOI":"10.23919\/wiopt71098.2026.11568225","type":"proceedings-article","created":{"date-parts":[[2026,6,23]],"date-time":"2026-06-23T19:43:31Z","timestamp":1782243811000},"page":"1-8","source":"Crossref","is-referenced-by-count":0,"title":["Fair Online Learning for Restless Bandits"],"prefix":"10.23919","author":[{"given":"Tasmeen Zaman","family":"Ornee","sequence":"first","affiliation":[{"name":"The Ohio State University,Department of ECE,Columbus,OH,USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Arnob","family":"Ghosh","sequence":"additional","affiliation":[{"name":"New Jersey Institute of Technology,Newark,NJ,USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ananthram","family":"Swami","sequence":"additional","affiliation":[{"name":"DEVCOM Army Research Laboratory,Adelphi,MD,USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ness B.","family":"Shroff","sequence":"additional","affiliation":[{"name":"The Ohio State University,Department of ECE,Columbus,OH,USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/SCT.1994.315792"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.2307\/3214163"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.2307\/3214547"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2068950"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2015.2487258"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2024.3408673"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/3565287.3610263"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2022.0101"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2023.3322620"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/MILCOM58377.2023.10356278"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM55648.2025.11044625"},{"key":"ref12","first-page":"3199","article-title":"Beyond UCB: Optimal and efficient contextual bandits with regression oracles","author":"Foster","year":"2020","journal-title":"ICML"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-34106-9_19"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2023.3333402"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i8.26207"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2019.2954310"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v38i14.29489"},{"key":"ref18","volume-title":"Dynamic programming and optimal control","volume":"1","author":"Bertsekas","year":"2011"},{"key":"ref19","article-title":"Near-optimal regret bounds for reinforcement learning","volume":"21","author":"Auer","year":"2008","journal-title":"NeurIPS"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/CISS.2008.4558699"},{"key":"ref21","article-title":"Fair online learning for restless bandits","volume-title":"Technical Report","author":"Ornee","year":"2026"},{"key":"ref22","article-title":"Regret bounds for Thompson sampling in episodic restless bandit problems","volume":"32","author":"Jung","year":"2019","journal-title":"NeurIPS"},{"key":"ref23","first-page":"11878","article-title":"Restless-UCB, an efficient and low-complexity algorithm for online restless bandits","volume":"33","author":"Wang","year":"2020","journal-title":"NeurIPS"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1002\/sat.964"}],"event":{"name":"2026 24th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","location":"Columbus, OH, USA","start":{"date-parts":[[2026,6,3]]},"end":{"date-parts":[[2026,6,6]]}},"container-title":["2026 24th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11568188\/11568163\/11568225.pdf?arnumber=11568225","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,24]],"date-time":"2026-06-24T05:47:53Z","timestamp":1782280073000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11568225\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,3]]},"references-count":24,"URL":"https:\/\/doi.org\/10.23919\/wiopt71098.2026.11568225","relation":{},"subject":[],"published":{"date-parts":[[2026,6,3]]}}}