{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T19:40:24Z","timestamp":1767987624045,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":39,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,10,17]],"date-time":"2022-10-17T00:00:00Z","timestamp":1665964800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,10,17]]},"DOI":"10.1145\/3511808.3557248","type":"proceedings-article","created":{"date-parts":[[2022,10,16]],"date-time":"2022-10-16T01:29:57Z","timestamp":1665883797000},"page":"2088-2097","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Bandit Learning in Many-to-One Matching Markets"],"prefix":"10.1145","author":[{"given":"Zilong","family":"Wang","sequence":"first","affiliation":[{"name":"Shanghai Jiao Tong University, Shanghai, China"}]},{"given":"Liya","family":"Guo","sequence":"additional","affiliation":[{"name":"Xiamen University, Xiamen, China"}]},{"given":"Junming","family":"Yin","sequence":"additional","affiliation":[{"name":"Tepper School of Business, Carnegie Mellon University, Pittsburgh, PA, USA"}]},{"given":"Shuai","family":"Li","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University, Shanghai, China"}]}],"member":"320","published-online":{"date-parts":[[2022,10,17]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(94)00026-A"},{"key":"e_1_3_2_1_2_1","volume-title":"Finite-time analysis of the multiarmed bandit problem. Machine learning","author":"Auer Peter","year":"2002","unstructured":"Peter Auer , Nicolo Cesa-Bianchi , and Paul Fischer . 2002. Finite-time analysis of the multiarmed bandit problem. Machine learning , Vol. 47 , 2 ( 2002 ), 235--256. Peter Auer, Nicolo Cesa-Bianchi, and Paul Fischer. 2002. Finite-time analysis of the multiarmed bandit problem. Machine learning, Vol. 47, 2 (2002), 235--256."},{"key":"e_1_3_2_1_3_1","volume-title":"Proceedings of the 38th International Conference on Machine Learning.","author":"Basu Soumya","year":"2021","unstructured":"Soumya Basu , Karthik Abinav Sankararaman , and Abishek Sankararaman . 2021 . Beyond log2(T) Regret for Decentralized Bandits in Matching Markets . In Proceedings of the 38th International Conference on Machine Learning. Soumya Basu, Karthik Abinav Sankararaman, and Abishek Sankararaman. 2021. Beyond log2(T) Regret for Decentralized Bandits in Matching Markets. In Proceedings of the 38th International Conference on Machine Learning."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/3327757.3327824"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1561\/2200000024"},{"key":"e_1_3_2_1_6_1","volume-title":"A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. The Annals of Mathematical Statistics","author":"Chernoff Herman","year":"1952","unstructured":"Herman Chernoff . 1952. A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. The Annals of Mathematical Statistics ( 1952 ), 493--507. Herman Chernoff. 1952. A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. The Annals of Mathematical Statistics (1952), 493--507."},{"key":"e_1_3_2_1_7_1","first-page":"1","article-title":"Learning strategies in decentralized matching markets under uncertain preferences","volume":"22","author":"Dai Xiaowu","year":"2021","unstructured":"Xiaowu Dai and Michael I Jordan . 2021 . Learning strategies in decentralized matching markets under uncertain preferences . Journal of Machine Learning Research , Vol. 22 , 260 (2021), 1 -- 50 . Xiaowu Dai and Michael I Jordan. 2021. Learning strategies in decentralized matching markets under uncertain preferences. Journal of Machine Learning Research, Vol. 22, 260 (2021), 1--50.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/1642293.1642445"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3488560.3498413"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1080\/00029890.1962.11989827"},{"key":"e_1_3_2_1_12_1","first-page":"784","article-title":"On explore-then-commit strategies","volume":"29","author":"Garivier Aur\u00e9lien","year":"2016","unstructured":"Aur\u00e9lien Garivier , Tor Lattimore , and Emilie Kaufmann . 2016 . On explore-then-commit strategies . Advances in Neural Information Processing Systems , Vol. 29 (2016), 784 -- 792 . Aur\u00e9lien Garivier, Tor Lattimore, and Emilie Kaufmann. 2016. On explore-then-commit strategies. Advances in Neural Information Processing Systems, Vol. 29 (2016), 784--792.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.3390\/ijerph19042232"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3033274.3084095"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2020.2013"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2302471"},{"key":"e_1_3_2_1_17_1","volume-title":"Job matching, coalition formation, and gross substitutes. Econometrica: Journal of the Econometric Society","author":"Kelso Alexander S","year":"1982","unstructured":"Alexander S Kelso Jr and Vincent P Crawford . 1982. Job matching, coalition formation, and gross substitutes. Econometrica: Journal of the Econometric Society ( 1982 ), 1483--1504. Alexander S Kelso Jr and Vincent P Crawford. 1982. Job matching, coalition formation, and gross substitutes. Econometrica: Journal of the Econometric Society (1982), 1483--1504."},{"key":"e_1_3_2_1_18_1","first-page":"26701","article-title":"The Hardness Analysis of Thompson Sampling for Combinatorial Semi-bandits with Greedy Oracle","volume":"34","author":"Kong Fang","year":"2021","unstructured":"Fang Kong , Yueran Yang , Wei Chen , and Shuai Li . 2021 . The Hardness Analysis of Thompson Sampling for Combinatorial Semi-bandits with Greedy Oracle . Advances in Neural Information Processing Systems , Vol. 34 (2021), 26701 -- 26713 . Fang Kong, Yueran Yang, Wei Chen, and Shuai Li. 2021. The Hardness Analysis of Thompson Sampling for Combinatorial Semi-bandits with Greedy Oracle. Advances in Neural Information Processing Systems, Vol. 34 (2021), 26701--26713.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2022\/439"},{"key":"e_1_3_2_1_20_1","volume-title":"Simultaneously Learning Stochastic and Adversarial Bandits with General Graph Feedback. In International Conference on Machine Learning. PMLR, 11473--11482","author":"Kong Fang","year":"2022","unstructured":"Fang Kong , Yichi Zhou , and Shuai Li . 2022 b. Simultaneously Learning Stochastic and Adversarial Bandits with General Graph Feedback. In International Conference on Machine Learning. PMLR, 11473--11482 . Fang Kong, Yichi Zhou, and Shuai Li. 2022b. Simultaneously Learning Stochastic and Adversarial Bandits with General Graph Feedback. In International Conference on Machine Learning. PMLR, 11473--11482."},{"key":"e_1_3_2_1_21_1","volume-title":"Bandit algorithms","author":"Lattimore Tor","unstructured":"Tor Lattimore and Csaba Szepesv\u00e1ri . 2020. Bandit algorithms . Cambridge University Press . Tor Lattimore and Csaba Szepesv\u00e1ri. 2020. Bandit algorithms. Cambridge University Press."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1093\/restud\/rdw041"},{"key":"e_1_3_2_1_23_1","volume-title":"International conference on machine learning. PMLR, 1245--1253","author":"Li Shuai","year":"2016","unstructured":"Shuai Li , Baoxiang Wang , Shengyu Zhang , and Wei Chen . 2016 . Contextual combinatorial cascading bandits . In International conference on machine learning. PMLR, 1245--1253 . Shuai Li, Baoxiang Wang, Shengyu Zhang, and Wei Chen. 2016. Contextual combinatorial cascading bandits. In International conference on machine learning. PMLR, 1245--1253."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2010.2062509"},{"key":"e_1_3_2_1_25_1","volume-title":"International Conference on Artificial Intelligence and Statistics. PMLR, 1618--1628","author":"Liu Lydia T","year":"2020","unstructured":"Lydia T Liu , Horia Mania , and Michael Jordan . 2020 a. Competing bandits in matching markets . In International Conference on Artificial Intelligence and Statistics. PMLR, 1618--1628 . Lydia T Liu, Horia Mania, and Michael Jordan. 2020a. Competing bandits in matching markets. In International Conference on Artificial Intelligence and Statistics. PMLR, 1618--1628."},{"key":"e_1_3_2_1_26_1","volume-title":"Bandit learning in decentralized matching markets. arXiv preprint arXiv:2012.07348","author":"Liu Lydia T","year":"2020","unstructured":"Lydia T Liu , Feng Ruan , Horia Mania , and Michael I Jordan . 2020b. Bandit learning in decentralized matching markets. arXiv preprint arXiv:2012.07348 ( 2020 ). Lydia T Liu, Feng Ruan, Horia Mania, and Michael I Jordan. 2020b. Bandit learning in decentralized matching markets. arXiv preprint arXiv:2012.07348 (2020)."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.25300\/MISQ\/2020\/14424"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0531(88)90150-0"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2016.2635380"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.2020.3869"},{"key":"e_1_3_2_1_31_1","volume-title":"Stability and polarization of interests in job matching. Econometrica: Journal of the Econometric Society","author":"Roth Alvin E","year":"1984","unstructured":"Alvin E Roth . 1984. Stability and polarization of interests in job matching. Econometrica: Journal of the Econometric Society ( 1984 ), 47--57. Alvin E Roth. 1984. Stability and polarization of interests in job matching. Econometrica: Journal of the Econometric Society (1984), 47--57."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0531(85)90106-1"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1111\/1468-0262.00335"},{"key":"e_1_3_2_1_34_1","volume-title":"Two-sided matching. Handbook of game theory with economic applications","author":"Roth Alvin E","year":"1992","unstructured":"Alvin E Roth and Marilda Sotomayor . 1992. Two-sided matching. Handbook of game theory with economic applications , Vol. 1 ( 1992 ), 485--541. Alvin E Roth and Marilda Sotomayor. 1992. Two-sided matching. Handbook of game theory with economic applications, Vol. 1 (1992), 485--541."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.mathsocsci.2017.11.003"},{"key":"e_1_3_2_1_36_1","volume-title":"International Conference on Artificial Intelligence and Statistics. PMLR, 1252--1260","author":"Sankararaman Abishek","year":"2021","unstructured":"Abishek Sankararaman , Soumya Basu , and Karthik Abinav Sankararaman . 2021 . Dominate or Delete: Decentralized Competing Bandits in Serial Dictatorship . In International Conference on Artificial Intelligence and Statistics. PMLR, 1252--1260 . Abishek Sankararaman, Soumya Basu, and Karthik Abinav Sankararaman. 2021. Dominate or Delete: Decentralized Competing Bandits in Serial Dictatorship. In International Conference on Artificial Intelligence and Statistics. PMLR, 1252--1260."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1060.0207"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2017.7952664"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/25.3-4.285"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512152"}],"event":{"name":"CIKM '22: The 31st ACM International Conference on Information and Knowledge Management","location":"Atlanta GA USA","acronym":"CIKM '22","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the 31st ACM International Conference on Information & Knowledge Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3511808.3557248","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3511808.3557248","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:49:07Z","timestamp":1750182547000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3511808.3557248"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,17]]},"references-count":39,"alternative-id":["10.1145\/3511808.3557248","10.1145\/3511808"],"URL":"https:\/\/doi.org\/10.1145\/3511808.3557248","relation":{},"subject":[],"published":{"date-parts":[[2022,10,17]]},"assertion":[{"value":"2022-10-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}