{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,23]],"date-time":"2025-08-23T05:09:27Z","timestamp":1755925767424,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,6,16]],"date-time":"2013-06-16T00:00:00Z","timestamp":1371340800000},"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":[[2013,6,16]]},"DOI":"10.1145\/2492002.2482583","type":"proceedings-article","created":{"date-parts":[[2013,6,11]],"date-time":"2013-06-11T16:03:50Z","timestamp":1370966630000},"page":"163-180","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["Budget smoothing for internet ad auctions"],"prefix":"10.1145","author":[{"given":"Denis","family":"Charles","sequence":"first","affiliation":[{"name":"Microsoft Research, Redmond, WA, USA"}]},{"given":"Deeparnab","family":"Chakrabarty","sequence":"additional","affiliation":[{"name":"Microsoft Research, Bangalore, India"}]},{"given":"Max","family":"Chickering","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, WA, USA"}]},{"given":"Nikhil R.","family":"Devanur","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, WA, USA"}]},{"given":"Lei","family":"Wang","sequence":"additional","affiliation":[{"name":"Microsoft adCenter, Bellevue, WA, USA"}]}],"member":"320","published-online":{"date-parts":[[2013,6,16]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250910.1250950"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1134707.1134708"},{"key":"e_1_3_2_1_3_1","unstructured":"AMIN K. KEARNS M. KEY P. AND SCHWAIGHOFER A. 2012. Budget optimization for sponsored search: Censored learning in mdps. In UAI.  AMIN K. KEARNS M. KEY P. AND SCHWAIGHOFER A. 2012. Budget optimization for sponsored search: Censored learning in mdps. In UAI."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-92185-1_63"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2229012.2229043"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1566374.1566384"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993574.1993581"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1257\/aer.97.1.242"},{"key":"e_1_3_2_1_9_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. 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. 182--194.","DOI":"10.1007\/978-3-642-15775-2_16"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2009.72"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250910.1250917"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1080\/00029890.1962.11989827"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2010.09.002"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25510-6_15"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.75"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2071379.2071381"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.12"},{"key":"e_1_3_2_1_18_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_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijindorg.2006.10.002"}],"event":{"name":"EC '13: ACM Conference on Electronic Commerce","sponsor":["SIGecom Special Interest Group on Economics and Computation"],"location":"Philadelphia Pennsylvania USA","acronym":"EC '13"},"container-title":["Proceedings of the fourteenth ACM conference on Electronic commerce"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2492002.2482583","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2492002.2482583","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:39:11Z","timestamp":1750235951000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2492002.2482583"}},"subtitle":["a game theoretic approach"],"short-title":[],"issued":{"date-parts":[[2013,6,16]]},"references-count":19,"alternative-id":["10.1145\/2492002.2482583","10.1145\/2492002"],"URL":"https:\/\/doi.org\/10.1145\/2492002.2482583","relation":{},"subject":[],"published":{"date-parts":[[2013,6,16]]},"assertion":[{"value":"2013-06-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}