{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,13]],"date-time":"2026-10-13T16:17:01Z","timestamp":1791908221784,"version":"4.3.4"},"publisher-location":"New York, NY, USA","reference-count":7,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,6,7]],"date-time":"2010-06-07T00:00:00Z","timestamp":1275868800000},"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":[[2010,6,7]]},"DOI":"10.1145\/1807342.1807360","type":"proceedings-article","created":{"date-parts":[[2010,6,8]],"date-time":"2010-06-08T08:37:34Z","timestamp":1275986254000},"page":"109-118","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":63,"title":["Optimal online assignment with forecasts"],"prefix":"10.1145","author":[{"given":"Erik","family":"Vee","sequence":"first","affiliation":[{"name":"Yahoo! Research, Sunnyvale, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sergei","family":"Vassilvitskii","sequence":"additional","affiliation":[{"name":"Yahoo! Research, New York, NY, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jayavel","family":"Shanmugasundaram","sequence":"additional","affiliation":[{"name":"Yahoo! Research, Sunnyvale, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2010,6,7]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/11538462_22"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1566374.1566384"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Jon Feldman Aranyak Mehta Vahab S. Mirrokni and S. Muthukrishnan. Online stochastic matching: Beating 1-1\/e. 2009.  Jon Feldman Aranyak Mehta Vahab S. Mirrokni and S. Muthukrishnan. Online stochastic matching: Beating 1-1\/e. 2009.","DOI":"10.1109\/FOCS.2009.72"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10841-9_20"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/100216.100262"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1284320.1284321"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1217856.1217860"}],"event":{"name":"EC '10: ACM Conference on Electronic Commerce","location":"Cambridge Massachusetts USA","acronym":"EC '10","sponsor":["SIGecom Special Interest Group on Economics and Computation"]},"container-title":["Proceedings of the 11th ACM conference on Electronic commerce"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1807342.1807360","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1807342.1807360","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:39:34Z","timestamp":1750232374000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1807342.1807360"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6,7]]},"references-count":7,"alternative-id":["10.1145\/1807342.1807360","10.1145\/1807342"],"URL":"https:\/\/doi.org\/10.1145\/1807342.1807360","relation":{},"subject":[],"published":{"date-parts":[[2010,6,7]]},"assertion":[{"value":"2010-06-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}