{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T05:38:58Z","timestamp":1782970738988,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":28,"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":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1552909 CCF-1617851 and IIS-1447470"],"award-info":[{"award-number":["CCF-1552909 CCF-1617851 and IIS-1447470"]}],"id":[{"id":"10.13039\/100000001","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.3085146","type":"proceedings-article","created":{"date-parts":[[2017,6,20]],"date-time":"2017-06-20T19:21:49Z","timestamp":1497986509000},"page":"99-116","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":15,"title":["The Stochastic Matching Problem"],"prefix":"10.1145","author":[{"given":"Sepehr","family":"Assadi","sequence":"first","affiliation":[{"name":"University of Pennsylvania, Philadelphia, PA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sanjeev","family":"Khanna","sequence":"additional","affiliation":[{"name":"University of Pennsylvania, Philadelphia, PA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yang","family":"Li","sequence":"additional","affiliation":[{"name":"University of Pennsylvania, Philadelphia, PA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2017,6,20]]},"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.1145\/2600057.2602887"},{"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.1002\/rsa.3240060107"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2940716.2940769"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"crossref","unstructured":"Sepehr Assadi Sanjeev Khanna and Yang Li. 2017. The Stochastic Matching Problem: Beating Half with a Non-Adaptive Algorithm. CoRR abs\/1705.02280 (2017).  Sepehr Assadi Sanjeev Khanna and Yang Li. 2017. The Stochastic Matching Problem: Beating Half with a Non-Adaptive Algorithm. CoRR abs\/1705.02280 (2017).","DOI":"10.1145\/3033274.3085146"},{"key":"e_1_3_2_2_8_1","volume-title":"IJCAI 2009, Proceedings of the 21st International Joint Conference on Artificial Intelligence","author":"Awasthi Pranjal","year":"2009"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-011-9511-8"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2764468.2764479"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2492002.2482569"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"crossref","unstructured":"B\u00e9la Bollob\u00e1s. 2001. Random Graphs. Number 73. Cambridge University Press.  B\u00e9la Bollob\u00e1s. 2001. Random Graphs. Number 73. Cambridge University Press.","DOI":"10.1017\/CBO9780511814068"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/2634074.2634156"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02927-1_23"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31594-7_69"},{"key":"e_1_3_2_2_16_1","volume-title":"Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence.","author":"Dickerson John P.","year":"2012"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2492002.2482596"},{"key":"e_1_3_2_2_18_1","volume-title":"Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, January 25--30","author":"John","year":"2015"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240020104"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.09.013"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36694-9_18"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/100216.100262"},{"key":"e_1_3_2_2_23_1","volume-title":"APPROX 2012, and 16th International Workshop, RANDOM 2012, Cambridge, MA, USA, August 15--17, 2012. Proceedings. 231--242","author":"Konrad Christian","year":"2012"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2670129"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2012.65"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/2722129.2722221"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2012.20"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-937X.2009.00575.x"}],"event":{"name":"EC '17: ACM Conference on Economics and Computation","location":"Cambridge Massachusetts USA","acronym":"EC '17","sponsor":["SIGecom Special Interest Group on Economics and Computation"]},"container-title":["Proceedings of the 2017 ACM Conference on Economics and Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3033274.3085146","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3033274.3085146","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3033274.3085146","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:36:46Z","timestamp":1750217806000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3033274.3085146"}},"subtitle":["Beating Half with a Non-Adaptive Algorithm"],"short-title":[],"issued":{"date-parts":[[2017,6,20]]},"references-count":28,"alternative-id":["10.1145\/3033274.3085146","10.1145\/3033274"],"URL":"https:\/\/doi.org\/10.1145\/3033274.3085146","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"}}]}}