{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,16]],"date-time":"2026-10-16T05:40:21Z","timestamp":1792129221654,"version":"4.4.0"},"publisher-location":"New York, NY, USA","reference-count":42,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,7,18]],"date-time":"2021-07-18T00:00:00Z","timestamp":1626566400000},"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":[[2021,7,18]]},"DOI":"10.1145\/3465456.3467652","type":"proceedings-article","created":{"date-parts":[[2021,7,18]],"date-time":"2021-07-18T10:28:50Z","timestamp":1626604130000},"page":"635-653","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Decentralized Matching in a Probabilistic Environment"],"prefix":"10.1145","author":[{"given":"Mobin Y.","family":"Jeloudar","sequence":"first","affiliation":[{"name":"Stanford University, Stanford, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Irene","family":"Lo","sequence":"additional","affiliation":[{"name":"Stanford University, Stanford, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tristan","family":"Pollner","sequence":"additional","affiliation":[{"name":"Stanford University, Stanford, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Amin","family":"Saberi","sequence":"additional","affiliation":[{"name":"Stanford University, Stanford, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2021,7,18]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2011.05.007"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2015.0766"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1086\/704761"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2018.1826"},{"key":"e_1_3_2_2_5_1","volume-title":"Pricing and optimization in shared vehicle systems: An approximation framework. arXiv preprint arXiv:1608.06819","author":"Banerjee Siddhartha","year":"2016","unstructured":"Siddhartha Banerjee , Daniel Freund , and Thodoris Lykouris . Pricing and optimization in shared vehicle systems: An approximation framework. arXiv preprint arXiv:1608.06819 , 2016 . Siddhartha Banerjee, Daniel Freund, and Thodoris Lykouris. Pricing and optimization in shared vehicle systems: An approximation framework. arXiv preprint arXiv:1608.06819, 2016."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2764468.2764527"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-011-9511-8"},{"key":"e_1_3_2_2_8_1","volume-title":"Dynamic programming and optimal control","author":"Bertsekas Dimitri P","year":"1995","unstructured":"Dimitri P Bertsekas . Dynamic programming and optimal control , volume 1 . Athena scientific Belmont, MA , 1995 . Dimitri P Bertsekas. Dynamic programming and optimal control, volume 1. Athena scientific Belmont, MA, 1995."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02927-1_23"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1566374.1566384"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2492002.2482596"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2009.72"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/DYSPAN.2010.5457857"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/3310435.3310611"},{"key":"e_1_3_2_2_15_1","first-page":"241","volume-title":"A dynamic allocation index for the sequential design of experiments. Progress in statistics","author":"Gittins John","year":"1974","unstructured":"John Gittins . A dynamic allocation index for the sequential design of experiments. Progress in statistics , pages 241 -- 266 , 1974 . John Gittins. A dynamic allocation index for the sequential design of experiments. Progress in statistics, pages 241--266, 1974."},{"key":"e_1_3_2_2_16_1","first-page":"982","volume-title":"SODA","volume":"8","author":"Goel Gagan","year":"2008","unstructured":"Gagan Goel and Aranyak Mehta . Online budgeted matching in random input models with applications to adwords . In SODA , volume 8 , pages 982 -- 991 , 2008 . Gagan Goel and Aranyak Mehta. Online budgeted matching in random input models with applications to adwords. In SODA, volume 8, pages 982--991, 2008."},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2012.19"},{"key":"e_1_3_2_2_18_1","volume-title":"Online matching with stochastic rewards: Optimal competitive ratio via path based formulation. arXiv preprint arXiv:1905.12778","author":"Goyal Vineet","year":"2019","unstructured":"Vineet Goyal and Rajan Udwani . Online matching with stochastic rewards: Optimal competitive ratio via path based formulation. arXiv preprint arXiv:1905.12778 , 2019 . Vineet Goyal and Rajan Udwani. Online matching with stochastic rewards: Optimal competitive ratio via path based formulation. arXiv preprint arXiv:1905.12778, 2019."},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36694-9_18"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/2884435.2884555"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974782.111"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1287\/13-SSY097"},{"key":"e_1_3_2_2_23_1","volume-title":"Dynamic type matching. Rotman School of Management Working Paper, (2592622)","author":"Hu Ming","year":"2020","unstructured":"Ming Hu and Yun Zhou . Dynamic type matching. Rotman School of Management Working Paper, (2592622) , 2020 . Ming Hu and Yun Zhou. Dynamic type matching. Rotman School of Management Working Paper, (2592622), 2020."},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384294"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2013.0621"},{"key":"e_1_3_2_2_26_1","volume-title":"Matching while learning. arXiv preprint arXiv:1603.04549","author":"Johari Ramesh","year":"2016","unstructured":"Ramesh Johari , Vijay Kamble , and Yash Kanoria . Matching while learning. arXiv preprint arXiv:1603.04549 , 2016 . Ramesh Johari, Vijay Kamble, and Yash Kanoria. Matching while learning. arXiv preprint arXiv:1603.04549, 2016."},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993715"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/100216.100262"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40450-4_50"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02930-1_42"},{"key":"e_1_3_2_2_31_1","first-page":"1618","volume-title":"International Conference on Artificial Intelligence and Statistics","author":"Liu Lydia T","year":"2020","unstructured":"Lydia T Liu , Horia Mania , and Michael Jordan . Competing bandits in matching markets . In International Conference on Artificial Intelligence and Statistics , pages 1618 -- 1628 . PMLR, 2020 . Lydia T Liu, Horia Mania, and Michael Jordan. Competing bandits in matching markets. In International Conference on Artificial Intelligence and Statistics, pages 1618--1628. PMLR, 2020."},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993716"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3391403.3399519"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1120.0551"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3391403.3399458"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2012.65"},{"key":"e_1_3_2_2_37_1","volume-title":"Adwords and generalized online matching. Journal of the ACM (JACM), 54(5):22--es","author":"Mehta Aranyak","year":"2007","unstructured":"Aranyak Mehta , Amin Saberi , Umesh Vazirani , and Vijay Vazirani . Adwords and generalized online matching. Journal of the ACM (JACM), 54(5):22--es , 2007 . Aranyak Mehta, Amin Saberi, Umesh Vazirani, and Vijay Vazirani. Adwords and generalized online matching. Journal of the ACM (JACM), 54(5):22--es, 2007."},{"key":"e_1_3_2_2_38_1","first-page":"1388","volume-title":"Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms","author":"Mehta Aranyak","year":"2014","unstructured":"Aranyak Mehta , Bo Waggoner , and Morteza Zadimoghaddam . Online stochastic matching with unequal probabilities . In Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms , pages 1388 -- 1404 . SIAM, 2014 . Aranyak Mehta, Bo Waggoner, and Morteza Zadimoghaddam. Online stochastic matching with unequal probabilities. In Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms, pages 1388--1404. SIAM, 2014."},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/11841036_48"},{"key":"e_1_3_2_2_40_1","volume-title":"The query-commit problem. arXiv preprint arXiv:1110.0990","author":"Molinaro Marco","year":"2011","unstructured":"Marco Molinaro and R Ravi . The query-commit problem. arXiv preprint arXiv:1110.0990 , 2011 . Marco Molinaro and R Ravi. The query-commit problem. arXiv preprint arXiv:1110.0990, 2011."},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.5555\/3174304.3175466"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.2307\/1910412"}],"event":{"name":"EC '21: The 22nd ACM Conference on Economics and Computation","location":"Budapest Hungary","acronym":"EC '21","sponsor":["SIGecom Special Interest Group on Economics and Computation"]},"container-title":["Proceedings of the 22nd ACM Conference on Economics and Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3465456.3467652","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3465456.3467652","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:17:28Z","timestamp":1750191448000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3465456.3467652"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,18]]},"references-count":42,"alternative-id":["10.1145\/3465456.3467652","10.1145\/3465456"],"URL":"https:\/\/doi.org\/10.1145\/3465456.3467652","relation":{},"subject":[],"published":{"date-parts":[[2021,7,18]]},"assertion":[{"value":"2021-07-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}