{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T01:24:41Z","timestamp":1740101081958,"version":"3.37.3"},"reference-count":26,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,9,27]],"date-time":"2022-09-27T00:00:00Z","timestamp":1664236800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,9,27]],"date-time":"2022-09-27T00:00:00Z","timestamp":1664236800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["1824418"],"award-info":[{"award-number":["1824418"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,9,27]]},"DOI":"10.1109\/allerton49937.2022.9929420","type":"proceedings-article","created":{"date-parts":[[2022,11,4]],"date-time":"2022-11-04T21:34:30Z","timestamp":1667597670000},"page":"1-8","source":"Crossref","is-referenced-by-count":1,"title":["Repeated Games, Optimal Channel Capture, and Open Problems for Slotted Multiple Access"],"prefix":"10.1109","author":[{"given":"Michael J.","family":"Neely","sequence":"first","affiliation":[{"name":"University of Southern California"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1985.1096261"},{"key":"ref11","first-page":"65","article-title":"Random multiple access of packets: Part and try algorithm","volume":"16","author":"tsybakov","year":"1980","journal-title":"Problemy Peredachi Informatsii (USSR)"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1978.1094204"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1979.1056093"},{"key":"ref14","first-page":"32","article-title":"Free synchronous packet access in a broadcast channel with feedback","volume":"14","author":"tsybakov","year":"1978","journal-title":"Problemy Peredachi Informatsii (USSR)"},{"key":"ref15","first-page":"90","article-title":"Upper bound for the capacity of a random multiple access system","volume":"17","author":"mikhailov","year":"1981","journal-title":"Problemy Peredachi Informatsii (USSR)"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539794279109"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1137\/0215032"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(92)90042-H"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/2767386.2767439"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2019.2912536"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2014.2382597"},{"key":"ref6","first-page":"916","article-title":"Coordination without communication: optimal regret in two players multi-armed bandits","author":"bubeck","year":"2020","journal-title":"Proceedings of Thirty Third Conference on Learning Theory volume 125 of Proceedings of Machine Learning Research"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/BF01824800"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2302471"},{"key":"ref7","first-page":"961","article-title":"Non-stochastic multi-player multi-armed bandits: Optimal rate with collision information, sublinear without","author":"bubeck","year":"2020","journal-title":"Proceedings of Thirty Third Conference on Learning Theory volume 125 of Proceedings of Machine Learning Research"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-4808-8_10"},{"journal-title":"Data Networks","year":"1992","author":"bertsekas","key":"ref9"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1402958.1402977"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1177\/002200278002400301"},{"journal-title":"Prisoner's Dilemma John von Neumann Game Theory and the Puzzle of the Bomb","year":"1993","author":"poundstone","key":"ref22"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1126\/science.7466396"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511800481"},{"journal-title":"A Course in Game Theory","year":"1994","author":"osborne","key":"ref23"},{"journal-title":"Repeated games optimal channel capture and open problems for slotted multiple access","year":"2021","author":"neely","key":"ref26"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2011.2169042"}],"event":{"name":"2022 58th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","start":{"date-parts":[[2022,9,27]]},"location":"Monticello, IL, USA","end":{"date-parts":[[2022,9,30]]}},"container-title":["2022 58th Annual Allerton Conference on Communication, Control, and Computing (Allerton)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9929313\/9929314\/09929420.pdf?arnumber=9929420","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,28]],"date-time":"2022-11-28T20:25:48Z","timestamp":1669667148000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9929420\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,27]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/allerton49937.2022.9929420","relation":{},"subject":[],"published":{"date-parts":[[2022,9,27]]}}}