{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:12:30Z","timestamp":1750306350518,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,8,13]],"date-time":"2016-08-13T00:00:00Z","timestamp":1471046400000},"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":[[2016,8,13]]},"DOI":"10.1145\/2939672.2939691","type":"proceedings-article","created":{"date-parts":[[2016,8,8]],"date-time":"2016-08-08T18:33:46Z","timestamp":1470681226000},"page":"117-126","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Online Dual Decomposition for Performance and Delivery-Based Distributed Ad Allocation"],"prefix":"10.1145","author":[{"given":"Jim C.","family":"Huang","sequence":"first","affiliation":[{"name":"Amazon, Seattle, WA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rodolphe","family":"Jenatton","sequence":"additional","affiliation":[{"name":"Amazon, Berlin, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cedric","family":"Archambeau","sequence":"additional","affiliation":[{"name":"Amazon, Berlin, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,8,13]]},"reference":[{"key":"e_1_3_2_2_1_1","first-page":"873","volume-title":"Advances in Neural Information Processing Systems","author":"Agarwal A.","year":"2011","unstructured":"A. Agarwal and J. C. Duchi . Distributed delayed stochastic optimization . In Advances in Neural Information Processing Systems , pages 873 -- 881 , 2011 . A. Agarwal and J. C. Duchi. Distributed delayed stochastic optimization. In Advances in Neural Information Processing Systems, pages 873--881, 2011."},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_2_1","DOI":"10.5555\/2722129.2722222"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_3_1","DOI":"10.1145\/2339530.2339720"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_4_1","DOI":"10.5555\/993483"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_5_1","DOI":"10.1145\/2532128"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_6_1","DOI":"10.1145\/2020408.2020604"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_7_1","DOI":"10.1287\/opre.8.1.101"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_8_1","DOI":"10.1287\/opre.11.3.399"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_9_1","DOI":"10.5555\/1888935.1888957"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_10_1","DOI":"10.1007\/978-3-642-10841-9_34"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_11_1","DOI":"10.1007\/s10994-007-5016-8"},{"key":"e_1_3_2_2_12_1","volume-title":"Online optimization and regret guarantees for non-additive long-term constraints. arXiv:1602.05394","author":"Jenatton R.","year":"2016","unstructured":"R. Jenatton , J. Huang , C. Archambeau , and D. Csiba . Online optimization and regret guarantees for non-additive long-term constraints. arXiv:1602.05394 , 2016 . R. Jenatton, J. Huang, C. Archambeau, and D. Csiba. Online optimization and regret guarantees for non-additive long-term constraints. arXiv:1602.05394, 2016."},{"key":"e_1_3_2_2_13_1","volume-title":"Optimization theory for Large Systems","author":"Lasdon L.","year":"1970","unstructured":"L. Lasdon . Optimization theory for Large Systems . MacMillan , 1970 . L. Lasdon. Optimization theory for Large Systems. MacMillan, 1970."},{"key":"e_1_3_2_2_14_1","volume-title":"Convex Analysis and Minimization Algorithms II","author":"Lemarechal C.","year":"1993","unstructured":"C. Lemarechal and J.-B. Hiriart-Urruty . Convex Analysis and Minimization Algorithms II . Springer-Verlag , 1993 . C. Lemarechal and J.-B. Hiriart-Urruty. Convex Analysis and Minimization Algorithms II. Springer-Verlag, 1993."},{"unstructured":"M. McEachran. Using Proportional Control For Better Pacing. http:\/\/rubiconproject.com\/technology-blog\/using-proportional-control-for-better-pacing\/ 2012.  M. McEachran. Using Proportional Control For Better Pacing. http:\/\/rubiconproject.com\/technology-blog\/using-proportional-control-for-better-pacing\/ 2012.","key":"e_1_3_2_2_15_1"},{"key":"e_1_3_2_2_16_1","first-page":"2915","volume-title":"Advances in Neural Information Processing Systems","author":"McMahan B.","year":"2014","unstructured":"B. McMahan and M. Streeter . Delay-tolerant algorithms for asynchronous distributed online learning . In Advances in Neural Information Processing Systems , pages 2915 -- 2923 , 2014 . B. McMahan and M. Streeter. Delay-tolerant algorithms for asynchronous distributed online learning. In Advances in Neural Information Processing Systems, pages 2915--2923, 2014."},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_17_1","DOI":"10.1561\/0400000057"},{"key":"e_1_3_2_2_18_1","volume-title":"Combinatorial Optimization: Polyhedra and Efficiency","author":"Schrijver A.","year":"2003","unstructured":"A. Schrijver . Combinatorial Optimization: Polyhedra and Efficiency , Volume A. Springer , 2003 . A. Schrijver. Combinatorial Optimization: Polyhedra and Efficiency, Volume A. Springer, 2003."},{"key":"e_1_3_2_2_19_1","volume-title":"Proceedings of the International Conference on Machine Learning (ICML)","author":"Zinkevich M.","year":"2003","unstructured":"M. Zinkevich . Online convex programming and generalized infinitesimal gradient ascent . In Proceedings of the International Conference on Machine Learning (ICML) , 2003 . M. Zinkevich. Online convex programming and generalized infinitesimal gradient ascent. In Proceedings of the International Conference on Machine Learning (ICML), 2003."}],"event":{"sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"],"acronym":"KDD '16","name":"KDD '16: The 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","location":"San Francisco California USA"},"container-title":["Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2939672.2939691","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2939672.2939691","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:55:57Z","timestamp":1750222557000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2939672.2939691"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,8,13]]},"references-count":19,"alternative-id":["10.1145\/2939672.2939691","10.1145\/2939672"],"URL":"https:\/\/doi.org\/10.1145\/2939672.2939691","relation":{},"subject":[],"published":{"date-parts":[[2016,8,13]]},"assertion":[{"value":"2016-08-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}