{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,26]],"date-time":"2026-09-26T21:22:41Z","timestamp":1790457761243,"version":"4.1.0"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,6,15]],"date-time":"2015-06-15T00:00:00Z","timestamp":1434326400000},"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":[[2015,6,15]]},"DOI":"10.1145\/2764468.2764536","type":"proceedings-article","created":{"date-parts":[[2015,6,12]],"date-time":"2015-06-12T14:43:54Z","timestamp":1434120234000},"page":"169-186","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":28,"title":["Online Allocation with Traffic Spikes"],"prefix":"10.1145","author":[{"given":"Hossein","family":"Esfandiari","sequence":"first","affiliation":[{"name":"University of Maryland, College Park, MD, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nitish","family":"Korula","sequence":"additional","affiliation":[{"name":"Google Research, New York, NY, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vahab","family":"Mirrokni","sequence":"additional","affiliation":[{"name":"Google Research, New York, NY, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2015,6,15]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Agrawal S. Wang Z. and Ye Y. 2009. A dynamic near-optimal algorithm for online linear programming. Computing Research Repository.  Agrawal S. Wang Z. and Ye Y. 2009. A dynamic near-optimal algorithm for online linear programming. Computing Research Repository."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2229012.2229018"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2006.886296"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780599"},{"key":"e_1_3_2_1_5_1","volume-title":"European Symposium on Algorithms. Springer, 170--181","author":"Bahmani B.","unstructured":"Bahmani , B. and Kapralov , M . 2010. Improved bounds for online stochastic matching . In European Symposium on Algorithms. Springer, 170--181 . Bahmani, B. and Kapralov, M. 2010. Improved bounds for online stochastic matching. In European Symposium on Algorithms. Springer, 170--181."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s101070100286"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2003.12.007"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Buchbinder N. Jain K. and Naor J. S. 2007. Online primal-dual algorithms for maximizing ad-auctions revenue. In ESA. Springer 253--264.   Buchbinder N. Jain K. and Naor J. S. 2007. Online primal-dual algorithms for maximizing ad-auctions revenue. In ESA. Springer 253--264.","DOI":"10.1007\/978-3-540-75520-3_24"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1566374.1566384"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993574.1993581"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2229012.2229043"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"Feldman J. Henzinger M. Korula N. Mirrokni V. S. and Stein C. 2010. Online stochastic packing applied to display ad allocation. In ESA. Springer 182--194.   Feldman J. Henzinger M. Korula N. Mirrokni V. S. and Stein C. 2010. Online stochastic packing applied to display ad allocation. In ESA. Springer 182--194.","DOI":"10.1007\/978-3-642-15775-2_16"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10841-9_34"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2009.72"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25510-6_15"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2013.0621"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(99)00140-1"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993715"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/100216.100262"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250910.1250952"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993716"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1284320.1284321"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"Menshadi V. H. Oveis Gharan S. and Saberi A. 2011. Online stochastic matching: Online actions based on offline statistics. In SODA. 1285--1294.   Menshadi V. H. Oveis Gharan S. 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_24_1","doi-asserted-by":"crossref","unstructured":"Mirrokni V. S. Oveis Gharan S. and Zadi Moghaddam M. 2011. Simultaneous approximations of stochastic and adversarial budgeted allocation problems. In SODA. 1690--1701.   Mirrokni V. S. Oveis Gharan S. and Zadi Moghaddam M. 2011. Simultaneous approximations of stochastic and adversarial budgeted allocation problems. In SODA. 1690--1701.","DOI":"10.1137\/1.9781611973099.134"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","unstructured":"Tan B. and Srikant R. 2011. Online advertisement optimization and stochastic networks. In CDC-ECC. IEEE 4504--4509.  Tan B. and Srikant R. 2011. Online advertisement optimization and stochastic networks. In CDC-ECC. IEEE 4504--4509.","DOI":"10.1109\/CDC.2011.6161009"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807342.1807360"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1151659.1159926"}],"event":{"name":"EC '15: ACM Conference on Economics and Computation","location":"Portland Oregon USA","acronym":"EC '15","sponsor":["SIGecom Special Interest Group on Economics and Computation"]},"container-title":["Proceedings of the Sixteenth ACM Conference on Economics and Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2764468.2764536","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2764468.2764536","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:12:23Z","timestamp":1750212743000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2764468.2764536"}},"subtitle":["Mixing Adversarial and Stochastic Models"],"short-title":[],"issued":{"date-parts":[[2015,6,15]]},"references-count":27,"alternative-id":["10.1145\/2764468.2764536","10.1145\/2764468"],"URL":"https:\/\/doi.org\/10.1145\/2764468.2764536","relation":{},"subject":[],"published":{"date-parts":[[2015,6,15]]},"assertion":[{"value":"2015-06-15","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}