{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,13]],"date-time":"2026-07-13T23:28:54Z","timestamp":1783985334888,"version":"3.55.0"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030353889","type":"print"},{"value":"9783030353896","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-35389-6_2","type":"book-chapter","created":{"date-parts":[[2019,11,21]],"date-time":"2019-11-21T01:06:49Z","timestamp":1574298409000},"page":"17-30","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":42,"title":["Autobidding with Constraints"],"prefix":"10.1007","author":[{"given":"Gagan","family":"Aggarwal","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ashwinkumar","family":"Badanidiyuru","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Aranyak","family":"Mehta","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,12,3]]},"reference":[{"key":"2_CR1","doi-asserted-by":"publisher","unstructured":"Agrawal, S., Devanur, N.R.: Fast algorithms for online stochastic convex programming. In: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, 4\u20136 January 2015, pp. 1405\u20131424 (2015). \nhttps:\/\/doi.org\/10.1137\/1.9781611973730.93","DOI":"10.1137\/1.9781611973730.93"},{"issue":"1","key":"2_CR2","doi-asserted-by":"publisher","first-page":"121","DOI":"10.4086\/toc.2012.v008a006","volume":"8","author":"S Arora","year":"2012","unstructured":"Arora, S., Hazan, E., Kale, S.: The multiplicative weights update method: a meta-algorithm and applications. Theory Comput. 8(1), 121\u2013164 (2012)","journal-title":"Theory Comput."},{"key":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-66700-3_1","volume-title":"Algorithmic Game Theory","author":"Y Azar","year":"2017","unstructured":"Azar, Y., Feldman, M., Gravin, N., Roytman, A.: Liquid price of anarchy. In: Bil\u00f2, V., Flammini, M. (eds.) SAGT 2017. LNCS, vol. 10504, pp. 3\u201315. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-66700-3_1"},{"key":"2_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/978-3-540-75520-3_24","volume-title":"Algorithms \u2013 ESA 2007","author":"N Buchbinder","year":"2007","unstructured":"Buchbinder, N., Jain, K., Naor, J.S.: Online primal-dual algorithms for maximizing ad-auctions revenue. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol. 4698, pp. 253\u2013264. Springer, Heidelberg (2007). \nhttps:\/\/doi.org\/10.1007\/978-3-540-75520-3_24"},{"key":"2_CR5","unstructured":"Google Ads Help Center: About automated bidding. \nhttps:\/\/support.google.com\/google-ads\/answer\/2979071\n\n. Accessed 12 Feb 2019"},{"key":"2_CR6","unstructured":"Google Ads Help Center: About universal app campaigns. \nhttps:\/\/support.google.com\/google-ads\/answer\/6247380\n\n. Accessed Feb 13 2019"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Charles, D.X., Chakrabarty, D., Chickering, M., Devanur, N.R., Wang, L.: Budget smoothing for internet ad auctions: a game theoretic approach. In: Proceedings of the Fourteenth ACM Conference on Electronic Commerce, EC 2013, Philadelphia, PA, USA, 16\u201320 June 2013, pp. 163\u2013180 (2013)","DOI":"10.1145\/2492002.2482583"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Chen, P., et al.: Ad serving using a compact allocation plan. In: Proceedings of the 13th ACM Conference on Electronic Commerce, EC 2012, Valencia, Spain, 4\u20138 June 2012, pp. 319\u2013336 (2012)","DOI":"10.1145\/2229012.2229038"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Chen, Y., Berkhin, P., Anderson, B., Devanur, N.R.: Real-time bidding algorithms for performance-based display ad allocation. In: Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, San Diego, CA, USA, 21\u201324 August 2011, pp. 1307\u20131315 (2011)","DOI":"10.1145\/2020408.2020604"},{"issue":"1","key":"2_CR10","doi-asserted-by":"publisher","first-page":"7:1","DOI":"10.1145\/3284177","volume":"66","author":"NR Devanur","year":"2019","unstructured":"Devanur, N.R., Jain, K., Sivan, B., Wilkens, C.A.: Near optimal online algorithms and fast approximation algorithms for resource allocation problems. J. ACM 66(1), 7:1\u20137:41 (2019). \nhttps:\/\/doi.org\/10.1145\/3284177","journal-title":"J. ACM"},{"key":"2_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1007\/978-3-662-43948-7_33","volume-title":"Automata, Languages, and Programming","author":"S Dobzinski","year":"2014","unstructured":"Dobzinski, S., Leme, R.P.: Efficiency guarantees in auctions with budgets. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014, Part I. LNCS, vol. 8572, pp. 392\u2013404. Springer, Heidelberg (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-662-43948-7_33"},{"key":"2_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/978-3-642-10841-9_34","volume-title":"Internet and Network Economics","author":"J Feldman","year":"2009","unstructured":"Feldman, J., Korula, N., Mirrokni, V., Muthukrishnan, S., P\u00e1l, M.: Online ad assignment with free disposal. In: Leonardi, S. (ed.) WINE 2009. LNCS, vol. 5929, pp. 374\u2013385. Springer, Heidelberg (2009). \nhttps:\/\/doi.org\/10.1007\/978-3-642-10841-9_34"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Feldman, J., Muthukrishnan, S., P\u00e1l, M., Stein, C.: Budget optimization in search-based advertising auctions. In: Proceedings 8th ACM Conference on Electronic Commerce (EC-2007), San Diego, California, USA, 11\u201315 June 2007, pp. 40\u201349 (2007)","DOI":"10.1145\/1250910.1250917"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Ghosh, A., Rubinstein, B.I.P., Vassilvitskii, S., Zinkevich, M.: Adaptive bidding for display advertising. In: Proceedings of the 18th International Conference on World Wide Web, WWW 2009, Madrid, Spain, 20\u201324 April 2009, pp. 251\u2013260 (2009)","DOI":"10.1145\/1526709.1526744"},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Karande, C., Mehta, A., Srikant, R.: Optimizing budget constrained spend in search advertising. In: Sixth ACM International Conference on Web Search and Data Mining, WSDM 2013, Rome, Italy, 4\u20138 February 2013, pp. 697\u2013706 (2013)","DOI":"10.1145\/2433396.2433483"},{"key":"2_CR16","unstructured":"Mehta, A.: Online matching and ad allocation. Found. Trends\u00ae Theor. Comput. Sci. 8(4), 265\u2013368 (2013)"},{"issue":"5","key":"2_CR17","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1145\/1284320.1284321","volume":"54","author":"A Mehta","year":"2007","unstructured":"Mehta, A., Saberi, A., Vazirani, U., Vazirani, V.: Adwords and generalized online matching. J. ACM 54(5), 22 (2007)","journal-title":"J. ACM"},{"key":"2_CR18","unstructured":"Plotkin, S.A., Shmoys, D.B., Tardos, \u00c9.: Fast approximation algorithms for fractional packing and covering problems. In: 32nd Annual Symposium on Foundations of Computer Science, San Juan, Puerto Rico, 1\u20134 October 1991, pp. 495\u2013504 (1991)"},{"issue":"4","key":"2_CR19","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1109\/TKDE.2017.2775228","volume":"30","author":"K Ren","year":"2018","unstructured":"Ren, K., Zhang, W., Chang, K., Rong, Y., Yu, Y., Wang, J.: Bidding machine: learning to bid for directly optimizing profits in display advertising. IEEE Trans. Knowl. Data Eng. 30(4), 645\u2013659 (2018)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"2_CR20","doi-asserted-by":"crossref","unstructured":"Zhang, W., Yuan, S., Wang, J.: Optimal real-time bidding for display advertising. In: The 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2014, New York, NY, USA, 24\u201327 August 2014, pp. 1077\u20131086 (2014)","DOI":"10.1145\/2623330.2623633"}],"container-title":["Lecture Notes in Computer Science","Web and Internet Economics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-35389-6_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,2]],"date-time":"2019-12-02T19:07:53Z","timestamp":1575313673000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-35389-6_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030353889","9783030353896"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-35389-6_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"3 December 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WINE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Web and Internet Economics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"New York City, NY","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 December 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 December 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wine0","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/wine2019.cs.columbia.edu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}