{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T14:34:59Z","timestamp":1773930899014,"version":"3.50.1"},"reference-count":23,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"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":[[2019,4]]},"DOI":"10.1109\/infocom.2019.8737653","type":"proceedings-article","created":{"date-parts":[[2019,6,18]],"date-time":"2019-06-18T00:35:56Z","timestamp":1560818156000},"page":"1693-1701","source":"Crossref","is-referenced-by-count":27,"title":["Distributed Learning and Optimal Assignment in Multiplayer Heterogeneous Networks"],"prefix":"10.1109","author":[{"given":"Harshvardhan","family":"Tibrewal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sravan","family":"Patchala","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manjesh K.","family":"Hanawal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sumit J.","family":"Darak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","first-page":"623","article-title":"The sample complexity of exploration in the multi-armed bandit problem","volume":"6","author":"mannor","year":"2004","journal-title":"Journal of Machine Learning and Research"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2010.2062509"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2015.2495154"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2014.2360821"},{"key":"ref14","article-title":"Multi-player bandits – a musical chairs approach","author":"rosenski","year":"2016","journal-title":"Proceedings of International Conference on Machine Learning (ICML)"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44848-9_5"},{"key":"ref16","article-title":"Trekking based distributed algorithm for opportunistic spectrum access in infrastructureless network","author":"kumar","year":"2018","journal-title":"Int Symp on Modeling and Optimization in Mobile Ad Hoc and Wireless Networks (WiOPT)"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2302471"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2016.7524557"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2016.2635380"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2011.110406"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2017.2740966"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1561\/2200000024"},{"key":"ref5","article-title":"Cognitive medium access: Exploration, exploitation, and competition","volume":"10","author":"lai","year":"2011","journal-title":"IEEE Transaction on Mobile Computing"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1137\/0105003"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800020109"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/MWC.2013.6507388"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/MCOMSTD.2017.1700042"},{"key":"ref9","first-page":"1079","article-title":"Action elimination and stopping conditions for the multi-armed bandit and reinforcement learning problems","volume":"7","author":"even-dar","year":"2006","journal-title":"Journal of Machine Learning and Research"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2018.8485937"},{"key":"ref22","article-title":"Hungarian algorithm (Kuhn-Munkres) for solving the linear sum assignment","author":"clapper","year":"2016"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1963.10500830"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(92)00175-L"}],"event":{"name":"IEEE INFOCOM 2019 - IEEE Conference on Computer Communications","location":"Paris, France","start":{"date-parts":[[2019,4,29]]},"end":{"date-parts":[[2019,5,2]]}},"container-title":["IEEE INFOCOM 2019 - IEEE Conference on Computer Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8732929\/8737365\/08737653.pdf?arnumber=8737653","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,15]],"date-time":"2022-07-15T03:22:36Z","timestamp":1657855356000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8737653\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/infocom.2019.8737653","relation":{},"subject":[],"published":{"date-parts":[[2019,4]]}}}