{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:10:59Z","timestamp":1750306259452,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":37,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,6,20]],"date-time":"2017-06-20T00:00:00Z","timestamp":1497916800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"ARO","award":["W911NF-14-1-0526"],"award-info":[{"award-number":["W911NF-14-1-0526"]}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-1544548,CNS-1343253"],"award-info":[{"award-number":["CNS-1544548,CNS-1343253"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000893","name":"Simons Foundation","doi-asserted-by":"publisher","award":["n\/a"],"award-info":[{"award-number":["n\/a"]}],"id":[{"id":"10.13039\/100000893","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,6,20]]},"DOI":"10.1145\/3033274.3084095","type":"proceedings-article","created":{"date-parts":[[2017,6,20]],"date-time":"2017-06-20T19:21:49Z","timestamp":1497986509000},"page":"119-119","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Matching while Learning"],"prefix":"10.1145","author":[{"given":"Ramesh","family":"Johari","sequence":"first","affiliation":[{"name":"Stanford University, Stanford, CA, USA"}]},{"given":"Vijay","family":"Kamble","sequence":"additional","affiliation":[{"name":"Stanford University, Stanford, CA, USA"}]},{"given":"Yash","family":"Kanoria","sequence":"additional","affiliation":[{"name":"Columbia University, New York , NY, USA"}]}],"member":"320","published-online":{"date-parts":[[2017,6,20]]},"reference":[{"issue":"3","key":"e_1_3_2_2_1_1","first-page":"258","article-title":"Asymptotically efficient adaptive allocation schemes for controlled iid processes: finite parameter space. phAutomatic Control","volume":"34","author":"Agrawal Rajeev","year":"1989","unstructured":"Rajeev Agrawal , Demosthenis Teneketzis , and Venkatachalam Anantharam . Asymptotically efficient adaptive allocation schemes for controlled iid processes: finite parameter space. phAutomatic Control , IEEE Transactions on , 34 ( 3 ): 258 -- 267 , 1989 . Rajeev Agrawal, Demosthenis Teneketzis, and Venkatachalam Anantharam. Asymptotically efficient adaptive allocation schemes for controlled iid processes: finite parameter space. phAutomatic Control, IEEE Transactions on, 34 (3): 258--267, 1989.","journal-title":"IEEE Transactions on"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2600057.2602844"},{"key":"e_1_3_2_2_3_1","volume-title":"Linear contextual bandits with global constraints and objective. pharXiv preprint arXiv:1507.06738","author":"Agrawal Shipra","year":"2015","unstructured":"Shipra Agrawal and Nikhil R Devanur . Linear contextual bandits with global constraints and objective. pharXiv preprint arXiv:1507.06738 , 2015 . Shipra Agrawal and Nikhil R Devanur. Linear contextual bandits with global constraints and objective. pharXiv preprint arXiv:1507.06738, 2015."},{"key":"e_1_3_2_2_4_1","volume-title":"Analysis of thompson sampling for the multi-armed bandit problem. pharXiv preprint arXiv:1111.1797","author":"Agrawal Shipra","year":"2011","unstructured":"Shipra Agrawal and Navin Goyal . Analysis of thompson sampling for the multi-armed bandit problem. pharXiv preprint arXiv:1111.1797 , 2011 . Shipra Agrawal and Navin Goyal. Analysis of thompson sampling for the multi-armed bandit problem. pharXiv preprint arXiv:1111.1797, 2011."},{"key":"e_1_3_2_2_5_1","volume-title":"Contextual bandits with global constraints and objective. pharXiv preprint arXiv:1506.03374","author":"Agrawal Shipra","year":"2015","unstructured":"Shipra Agrawal , Nikhil R Devanur , and Lihong Li . Contextual bandits with global constraints and objective. pharXiv preprint arXiv:1506.03374 , 2015 . Shipra Agrawal, Nikhil R Devanur, and Lihong Li. Contextual bandits with global constraints and objective. pharXiv preprint arXiv:1506.03374, 2015."},{"key":"e_1_3_2_2_6_1","volume-title":"Dynamic matching market design. phAvailable at SSRN 2394319","author":"Akbarpour Mohammad","year":"2014","unstructured":"Mohammad Akbarpour , Shengwu Li , and Shayan Oveis Gharan . Dynamic matching market design. phAvailable at SSRN 2394319 , 2014 . Mohammad Akbarpour, Shengwu Li, and Shayan Oveis Gharan. Dynamic matching market design. phAvailable at SSRN 2394319, 2014."},{"key":"e_1_3_2_2_7_1","first-page":"1925","volume-title":"A dynamic model of barter exchange. In phProceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Anderson Ross","year":"2015","unstructured":"Ross Anderson , Itai Ashlagi , David Gamarnik , and Yash Kanoria . A dynamic model of barter exchange. In phProceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms , pages 1925 -- 1933 . SIAM , 2015 . Ross Anderson, Itai Ashlagi, David Gamarnik, and Yash Kanoria. A dynamic model of barter exchange. In phProceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 1925--1933. SIAM, 2015."},{"key":"e_1_3_2_2_8_1","volume-title":"Heavy traffic analysis of open processing networks with complete resource pooling: asymptotic optimality of discrete review policies. phThe Annals of Applied Probability, 15 (1A): 331--391","author":"Ata Baris","year":"2005","unstructured":"Baris Ata and Sunil Kumar . Heavy traffic analysis of open processing networks with complete resource pooling: asymptotic optimality of discrete review policies. phThe Annals of Applied Probability, 15 (1A): 331--391 , 2005 . Baris Ata and Sunil Kumar. Heavy traffic analysis of open processing networks with complete resource pooling: asymptotic optimality of discrete review policies. phThe Annals of Applied Probability, 15 (1A): 331--391, 2005."},{"key":"e_1_3_2_2_9_1","volume-title":"Introduction to bandits: Algorithms and theory. In phICML","author":"Audibert J.-Y.","year":"2011","unstructured":"J.-Y. Audibert and R. Munos . Introduction to bandits: Algorithms and theory. In phICML , 2011 . J.-Y. Audibert and R. Munos. Introduction to bandits: Algorithms and theory. In phICML, 2011."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013689704352"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2559152"},{"key":"e_1_3_2_2_12_1","volume-title":"Optimal dynamic matching. phAvailable at SSRN 2641670","author":"Baccara Mariagiovanna","year":"2015","unstructured":"Mariagiovanna Baccara , SangMok Lee , and Leeat Yariv . Optimal dynamic matching. phAvailable at SSRN 2641670 , 2015 . Mariagiovanna Baccara, SangMok Lee, and Leeat Yariv. Optimal dynamic matching. phAvailable at SSRN 2641670, 2015."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2229012.2229026"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.30"},{"key":"e_1_3_2_2_15_1","first-page":"1109","volume-title":"Resourceful contextual bandits. In phProceedings of The 27th Conference on Learning Theory","author":"Badanidiyuru Ashwinkumar","year":"2014","unstructured":"Ashwinkumar Badanidiyuru , John Langford , and Aleksandrs Slivkins . Resourceful contextual bandits. In phProceedings of The 27th Conference on Learning Theory , pages 1109 -- 1134 , 2014 . Ashwinkumar Badanidiyuru, John Langford, and Aleksandrs Slivkins. Resourceful contextual bandits. In phProceedings of The 27th Conference on Learning Theory, pages 1109--1134, 2014."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1080.0640"},{"key":"e_1_3_2_2_17_1","volume-title":"Blind network revenue management. phOperations research, 60 (6): 1537--1550","author":"Besbes Omar","year":"2012","unstructured":"Omar Besbes and Assaf Zeevi . Blind network revenue management. phOperations research, 60 (6): 1537--1550 , 2012 . Omar Besbes and Assaf Zeevi. Blind network revenue management. phOperations research, 60 (6): 1537--1550, 2012."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"crossref","DOI":"10.1561\/9781601986276","volume-title":"Regret analysis of stochastic and nonstochastic multi-armed bandit problems. phMachine Learning, 5 (1): 1--122","author":"Bubeck S\u00e9bastien","year":"2012","unstructured":"S\u00e9bastien Bubeck and Nicolo Cesa-Bianchi . Regret analysis of stochastic and nonstochastic multi-armed bandit problems. phMachine Learning, 5 (1): 1--122 , 2012 . S\u00e9bastien Bubeck and Nicolo Cesa-Bianchi. Regret analysis of stochastic and nonstochastic multi-armed bandit problems. phMachine Learning, 5 (1): 1--122, 2012."},{"key":"e_1_3_2_2_19_1","first-page":"49","volume-title":"On positive harris recurrence of multiclass queueing networks: a unified approach via fluid limit models. phThe Annals of Applied Probability","author":"Dai Jim G","year":"1995","unstructured":"Jim G Dai . On positive harris recurrence of multiclass queueing networks: a unified approach via fluid limit models. phThe Annals of Applied Probability , pages 49 -- 77 , 1995 . Jim G Dai. On positive harris recurrence of multiclass queueing networks: a unified approach via fluid limit models. phThe Annals of Applied Probability, pages 49--77, 1995."},{"key":"e_1_3_2_2_20_1","volume-title":"Stability in dynamic matching markets. phGames and Economic Behavior, 52 (1): 34--53","author":"Damiano Ettore","year":"2005","unstructured":"Ettore Damiano and Ricky Lam . Stability in dynamic matching markets. phGames and Economic Behavior, 52 (1): 34--53 , 2005 . Ettore Damiano and Ricky Lam. Stability in dynamic matching markets. phGames and Economic Behavior, 52 (1): 34--53, 2005."},{"key":"e_1_3_2_2_21_1","first-page":"947","volume-title":"Two-sided bandits and the dating market. In phProceedings of the 19th international joint conference on Artificial intelligence","author":"Das Sanmay","year":"2005","unstructured":"Sanmay Das and Emir Kamenica . Two-sided bandits and the dating market. In phProceedings of the 19th international joint conference on Artificial intelligence , pages 947 -- 952 . Morgan Kaufmann Publishers Inc ., 2005 . Sanmay Das and Emir Kamenica. Two-sided bandits and the dating market. In phProceedings of the 19th international joint conference on Artificial intelligence, pages 947--952. Morgan Kaufmann Publishers Inc., 2005."},{"key":"e_1_3_2_2_22_1","volume-title":"Citeseer","author":"Fershtman Daniel","year":"2015","unstructured":"Daniel Fershtman and Alessandro Pavan . Dynamic matching: experimentation and cross subsidization. Technical report , Citeseer , 2015 . Daniel Fershtman and Alessandro Pavan. Dynamic matching: experimentation and cross subsidization. Technical report, Citeseer, 2015."},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1002\/9780470980033"},{"key":"e_1_3_2_2_24_1","volume-title":"Dynamic matching in a two-sided market. phAvailable at SSRN","author":"Hu Ming","year":"2015","unstructured":"Ming Hu and Yun Zhou . Dynamic matching in a two-sided market. phAvailable at SSRN , 2015 . Ming Hu and Yun Zhou. Dynamic matching in a two-sided market. phAvailable at SSRN, 2015."},{"key":"e_1_3_2_2_25_1","volume-title":"Multi-period matching. Technical report","author":"Kadam Sangram V","year":"2015","unstructured":"Sangram V Kadam and Maciej H Kotowski . Multi-period matching. Technical report , Harvard University , John F. Kennedy School of Government, 2015 . Sangram V Kadam and Maciej H Kotowski. Multi-period matching. Technical report, Harvard University, John F. Kennedy School of Government, 2015."},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-34106-9_18"},{"key":"e_1_3_2_2_27_1","volume-title":"efficiency, and stability: A theory of dynamic matching markets","author":"Kurino Morimitsu","year":"2005","unstructured":"Morimitsu Kurino . Credibility , efficiency, and stability: A theory of dynamic matching markets . 2005 . Morimitsu Kurino. Credibility, efficiency, and stability: A theory of dynamic matching markets. 2005."},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-8858(85)90002-8"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.49.8.1018.16402"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1040.0172"},{"key":"e_1_3_2_2_31_1","volume-title":"On the capacity of information processing systems","author":"Massoulie Laurent","year":"2016","unstructured":"Laurent Massoulie and Kuang Xu . On the capacity of information processing systems , 2016 . Unpublished . Laurent Massoulie and Kuang Xu. On the capacity of information processing systems, 2016. Unpublished."},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1561\/0400000057"},{"key":"e_1_3_2_2_33_1","volume-title":"Learning to optimize via posterior sampling. phMathematics of Operations Research, 39 (4): 1221--1243","author":"Russo Daniel","year":"2014","unstructured":"Daniel Russo and Benjamin Van Roy . Learning to optimize via posterior sampling. phMathematics of Operations Research, 39 (4): 1221--1243 , 2014 . Daniel Russo and Benjamin Van Roy. Learning to optimize via posterior sampling. phMathematics of Operations Research, 39 (4): 1221--1243, 2014."},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1287\/msom.2013.0429"},{"key":"e_1_3_2_2_35_1","volume-title":"The assignment game i: The core. phInternational Journal of game theory, 1 (1): 111--130","author":"Shapley Lloyd S","year":"1971","unstructured":"Lloyd S Shapley and Martin Shubik . The assignment game i: The core. phInternational Journal of game theory, 1 (1): 111--130 , 1971 . Lloyd S Shapley and Martin Shubik. The assignment game i: The core. phInternational Journal of game theory, 1 (1): 111--130, 1971."},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488388.2488490"},{"key":"e_1_3_2_2_37_1","volume-title":"Close the gaps: A learning-while-doing algorithm for single-product revenue management problems. phOperations Research, 62 (2): 318--331","author":"Wang Zizhuo","year":"2014","unstructured":"Zizhuo Wang , Shiming Deng , and Yinyu Ye . Close the gaps: A learning-while-doing algorithm for single-product revenue management problems. phOperations Research, 62 (2): 318--331 , 2014 . Zizhuo Wang, Shiming Deng, and Yinyu Ye. Close the gaps: A learning-while-doing algorithm for single-product revenue management problems. phOperations Research, 62 (2): 318--331, 2014."}],"event":{"name":"EC '17: ACM Conference on Economics and Computation","sponsor":["SIGecom Special Interest Group on Economics and Computation"],"location":"Cambridge Massachusetts USA","acronym":"EC '17"},"container-title":["Proceedings of the 2017 ACM Conference on Economics and Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3033274.3084095","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3033274.3084095","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3033274.3084095","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:24:14Z","timestamp":1750220654000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3033274.3084095"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,20]]},"references-count":37,"alternative-id":["10.1145\/3033274.3084095","10.1145\/3033274"],"URL":"https:\/\/doi.org\/10.1145\/3033274.3084095","relation":{},"subject":[],"published":{"date-parts":[[2017,6,20]]},"assertion":[{"value":"2017-06-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}