{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:14:41Z","timestamp":1763468081110,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,6,4]],"date-time":"2012-06-04T00:00:00Z","timestamp":1338768000000},"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":[[2012,6,4]]},"DOI":"10.1145\/2229012.2229043","type":"proceedings-article","created":{"date-parts":[[2012,6,5]],"date-time":"2012-06-05T17:35:37Z","timestamp":1338917737000},"page":"388-404","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":24,"title":["Asymptotically optimal algorithm for stochastic adwords"],"prefix":"10.1145","author":[{"given":"Nikhil R.","family":"Devanur","sequence":"first","affiliation":[{"name":"Microsoft Research, Redmond, WA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Balasubramanian","family":"Sivan","sequence":"additional","affiliation":[{"name":"University of Wisconsin-Madison, Madison, WI, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yossi","family":"Azar","sequence":"additional","affiliation":[{"name":"Tel-Aviv University, Tel-Aviv, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,6,4]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"BAHMANI B. AND KAPRALOV M. 2010. Improved bounds for online stochastic matching. In ESA. 170--181.   BAHMANI B. AND KAPRALOV M. 2010. Improved bounds for online stochastic matching. In ESA. 170--181.","DOI":"10.1007\/978-3-642-15775-2_15"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/1778580.1778606"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807342.1807362"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1566374.1566384"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993574.1993581"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2009.72"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25510-6_15"},{"key":"e_1_3_2_1_8_1","volume-title":"Developments from a","author":"KALYANASUNDARAM B.","year":"1996","unstructured":"KALYANASUNDARAM , B. AND PRUHS , K. 1998. On-line network optimization problems . In Developments from a June 1996 seminar on Online algorithms: the state of the art. Springer-Verlag , London, UK, 268--280. KALYANASUNDARAM, B. AND PRUHS, K. 1998. On-line network optimization problems. In Developments from a June 1996 seminar on Online algorithms: the state of the art. Springer-Verlag, London, UK, 268--280."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993715"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-7152(03)00037-3"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993716"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"MANSHADI V. H. GHARAN S. O. AND SABERI A. 2011. Online stochastic matching: Online actions based on offline statistics. In SODA. 1285--1294.   MANSHADI V. H. GHARAN S. O. AND SABERI A. 2011. Online stochastic matching: Online actions based on offline statistics. In SODA. 1285--1294.","DOI":"10.1137\/1.9781611973082.98"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.12"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"MIRROKNI V. GHARAN S. O. AND ZADIMOGHADDAM M. 2012. Simultaneous approximations for adversarial and stochastic online budgeted allocation. In SODA.   MIRROKNI V. GHARAN S. O. AND ZADIMOGHADDAM M. 2012. Simultaneous approximations for adversarial and stochastic online budgeted allocation. In SODA.","DOI":"10.1137\/1.9781611973099.134"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"YAN Q. 2011. Mechanism design via correlation gap. In SODA. 710--719.   YAN Q. 2011. Mechanism design via correlation gap. In SODA. 710--719.","DOI":"10.1137\/1.9781611973082.56"}],"event":{"name":"EC '12: ACM Conference on Electronic Commerce","sponsor":["SIGecom Special Interest Group on Economics and Computation"],"location":"Valencia Spain","acronym":"EC '12"},"container-title":["Proceedings of the 13th ACM Conference on Electronic Commerce"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2229012.2229043","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2229012.2229043","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:48:59Z","timestamp":1750236539000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2229012.2229043"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6,4]]},"references-count":15,"alternative-id":["10.1145\/2229012.2229043","10.1145\/2229012"],"URL":"https:\/\/doi.org\/10.1145\/2229012.2229043","relation":{},"subject":[],"published":{"date-parts":[[2012,6,4]]},"assertion":[{"value":"2012-06-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}