{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T05:39:04Z","timestamp":1782970744278,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,6,11]],"date-time":"2018-06-11T00:00:00Z","timestamp":1528675200000},"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":[[2018,6,11]]},"DOI":"10.1145\/3219166.3219226","type":"proceedings-article","created":{"date-parts":[[2018,9,21]],"date-time":"2018-09-21T12:42:08Z","timestamp":1537533728000},"page":"235-249","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["Almost Optimal Stochastic Weighted Matching with Few Queries"],"prefix":"10.1145","author":[{"given":"Soheil","family":"Behnezhad","sequence":"first","affiliation":[{"name":"University of Maryland, College Park, MD, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nima","family":"Reyhani","sequence":"additional","affiliation":[{"name":"Upwork Inc., Mountain View, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2018,6,11]]},"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","volume-title":"Dynamic matching market design. arXiv preprint arXiv:1402.3643","author":"Akbarpour Mohammad","year":"2014","unstructured":"Mohammad Akbarpour , Shengwu Li , and Shayan Oveis Gharan . 2014. Dynamic matching market design. arXiv preprint arXiv:1402.3643 ( 2014 ). Mohammad Akbarpour, Shengwu Li, and Shayan Oveis Gharan. 2014. Dynamic matching market design. arXiv preprint arXiv:1402.3643 (2014)."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/2722129.2722258"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1421853112"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2940716.2940769"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3033274.3085146"},{"key":"e_1_3_2_2_7_1","volume-title":"IJCAI","volume":"9","author":"Awasthi Pranjal","year":"2009","unstructured":"Pranjal Awasthi and Tuomas Sandholm . 2009 . Online Stochastic Optimization in the Large: Application to Kidney Exchange . IJCAI , Vol. Vol. 9 . 405--411. Pranjal Awasthi and Tuomas Sandholm. 2009. Online Stochastic Optimization in the Large: Application to Kidney Exchange. IJCAI, Vol. Vol. 9. 405--411."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-011-9511-8"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2764468.2764479"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2492002.2482569"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02927-1_23"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31594-7_69"},{"key":"e_1_3_2_2_13_1","volume-title":"Improved streaming algorithms for weighted matching, via unweighted matching LIPIcs-Leibniz International Proceedings in Informatics","author":"Crouch Michael","unstructured":"Michael Crouch and Daniel M Stubbs . 2014. Improved streaming algorithms for weighted matching, via unweighted matching LIPIcs-Leibniz International Proceedings in Informatics , Vol. Vol. 28 . Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik . Michael Crouch and Daniel M Stubbs. 2014. Improved streaming algorithms for weighted matching, via unweighted matching LIPIcs-Leibniz International Proceedings in Informatics, Vol. Vol. 28. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik."},{"key":"e_1_3_2_2_14_1","volume-title":"AAAI","volume":"2012","author":"Dickerson John P","year":"2012","unstructured":"John P Dickerson , Ariel D Procaccia , and Tuomas Sandholm . 2012 a. Dynamic Matching via Weighted Myopia with Application to Kidney Exchange . AAAI , Vol. Vol. 2012 . 98--100. John P Dickerson, Ariel D Procaccia, and Tuomas Sandholm. 2012 a. Dynamic Matching via Weighted Myopia with Application to Kidney Exchange. AAAI, Vol. Vol. 2012. 98--100."},{"key":"e_1_3_2_2_15_1","volume-title":"2012 b. Optimizing kidney exchange with transplant chains: Theory and reality Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems-Volume 2","author":"Dickerson John P","unstructured":"John P Dickerson , Ariel D Procaccia , and Tuomas Sandholm . 2012 b. Optimizing kidney exchange with transplant chains: Theory and reality Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems-Volume 2 . International Foundation for Autonomous Agents and Multiagent Systems , 711--718. John P Dickerson, Ariel D Procaccia, and Tuomas Sandholm. 2012 b. Optimizing kidney exchange with transplant chains: Theory and reality Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems-Volume 2. International Foundation for Autonomous Agents and Multiagent Systems, 711--718."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2492002.2482596"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"crossref","unstructured":"John P Dickerson and Tuomas Sandholm. 2015. FutureMatch: Combining Human Value Judgments and Machine Learning to Match in Dynamic Environments.. In AAAI. 622--628.   John P Dickerson and Tuomas Sandholm. 2015. FutureMatch: Combining Human Value Judgments and Machine Learning to Match in Dynamic Environments.. In AAAI. 622--628.","DOI":"10.1609\/aaai.v29i1.9239"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36694-9_18"},{"key":"e_1_3_2_2_19_1","volume-title":"Stochastic Packing Integer Programs with Few Queries Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM.","author":"Maehara Takanori","year":"2018","unstructured":"Takanori Maehara and Yutaro Yamaguchi . 2018 . Stochastic Packing Integer Programs with Few Queries Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM. Takanori Maehara and Yutaro Yamaguchi. 2018. Stochastic Packing Integer Programs with Few Queries Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-30850-5_24"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-937X.2009.00575.x"}],"event":{"name":"EC '18: ACM Conference on Economics and Computation","location":"Ithaca NY USA","acronym":"EC '18","sponsor":["SIGecom Special Interest Group on Economics and Computation"]},"container-title":["Proceedings of the 2018 ACM Conference on Economics and Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3219166.3219226","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3219166.3219226","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:39:16Z","timestamp":1750210756000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3219166.3219226"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,11]]},"references-count":21,"alternative-id":["10.1145\/3219166.3219226","10.1145\/3219166"],"URL":"https:\/\/doi.org\/10.1145\/3219166.3219226","relation":{},"subject":[],"published":{"date-parts":[[2018,6,11]]},"assertion":[{"value":"2018-06-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}