{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T04:57:23Z","timestamp":1768280243789,"version":"3.49.0"},"reference-count":26,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Tsinghua University Dushi Program"},{"name":"Shanghai Qi Zhi Institute"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Netw."],"published-print":{"date-parts":[[2026]]},"DOI":"10.1109\/ton.2025.3641175","type":"journal-article","created":{"date-parts":[[2025,12,11]],"date-time":"2025-12-11T18:44:30Z","timestamp":1765478670000},"page":"2149-2164","source":"Crossref","is-referenced-by-count":0,"title":["Decentralized Many-to-One Resource Allocation: The Competing Bandit Approach"],"prefix":"10.1109","volume":"34","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-5171-389X","authenticated-orcid":false,"given":"Yirui","family":"Zhang","sequence":"first","affiliation":[{"name":"Tsinghua University, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7979-4269","authenticated-orcid":false,"given":"Zhixuan","family":"Fang","sequence":"additional","affiliation":[{"name":"Tsinghua University, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","first-page":"476","article-title":"Assortment planning for two-sided sequential matching markets","volume-title":"Proc. 16th Int. Conf. Web Internet Econ.","author":"Ashlagi"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44848-9_5"},{"key":"ref3","first-page":"705","article-title":"Beyond log 2(t) regret for decentralized bandits in matching markets","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Basu"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2016.60"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2018.8486258"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/3084041.3084062"},{"key":"ref7","first-page":"947","article-title":"Two-sided bandits and the dating market","volume-title":"Proc. IJCAI","volume":"5","author":"Das"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.21236\/AD0251958"},{"key":"ref9","article-title":"Bandit learning in many-to-one matching markets with uniqueness conditions","author":"Guo","year":"2023"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-56252-0"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2023.3272696"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ICDSP.2011.6004983"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1287\/moor.12.2.262"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977554.ch55"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v38i12.29226"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2022\/439"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2011.2158673"},{"key":"ref18","first-page":"1618","article-title":"Competing bandits in matching markets","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Liu"},{"issue":"211","key":"ref19","first-page":"1","article-title":"Bandit learning in decentralized matching markets","volume":"22","author":"Liu","year":"2020","journal-title":"J. Mach. Learn. Res."},{"key":"ref20","first-page":"15081","article-title":"Decentralized, communication-and coordination-free learning in structured matching markets","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"35","author":"Maheshwari"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/98.788210"},{"key":"ref22","first-page":"155","article-title":"Multi-player bandits\u2014A musical chairs approach","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Rosenski"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1086\/262074"},{"key":"ref24","first-page":"1252","article-title":"Dominate or delete: Decentralized competing bandits in serial dictatorship","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Sankararaman"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/3511808.3557248"},{"key":"ref26","first-page":"9552","article-title":"Matching in multi-arm bandit with collision","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"35","author":"Zhang"}],"container-title":["IEEE Transactions on Networking"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10723154\/11317935\/11296967.pdf?arnumber=11296967","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,12]],"date-time":"2026-01-12T22:00:04Z","timestamp":1768255204000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11296967\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/ton.2025.3641175","relation":{},"ISSN":["2998-4157"],"issn-type":[{"value":"2998-4157","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]}}}