{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T05:00:36Z","timestamp":1772686836538,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":18,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819610891","type":"print"},{"value":"9789819610907","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-981-96-1090-7_21","type":"book-chapter","created":{"date-parts":[[2025,3,4]],"date-time":"2025-03-04T16:33:11Z","timestamp":1741105991000},"page":"252-263","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Near-Optimal Algorithm for\u00a0Supporting Small and\u00a0Medium-Sized Enterprises in\u00a0Ad Systems"],"prefix":"10.1007","author":[{"given":"Weian","family":"Li","sequence":"first","affiliation":[]},{"given":"Qi","family":"Qi","sequence":"additional","affiliation":[]},{"given":"Bingzhe","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Tao","family":"Xiao","sequence":"additional","affiliation":[]},{"given":"Changyuan","family":"Yu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,3,5]]},"reference":[{"key":"21_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-030-35389-6_2","volume-title":"Web and Internet Economics","author":"G Aggarwal","year":"2019","unstructured":"Aggarwal, G., Badanidiyuru, A., Mehta, A.: Autobidding with constraints. In: Caragiannis, I., Mirrokni, V., Nikolova, E. (eds.) WINE 2019. LNCS, vol. 11920, pp. 17\u201330. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-35389-6_2"},{"issue":"4","key":"21_CR2","doi-asserted-by":"publisher","first-page":"876","DOI":"10.1287\/opre.2014.1289","volume":"62","author":"S Agrawal","year":"2014","unstructured":"Agrawal, S., Wang, Z., Ye, Y.: A dynamic near-optimal algorithm for online linear programming. Oper. Res. 62(4), 876\u2013890 (2014)","journal-title":"Oper. Res."},{"key":"21_CR3","unstructured":"Balseiro, S., Lu, H., Mirrokni, V.: Dual mirror descent for online allocation problems. In: International Conference on Machine Learning, pp. 613\u2013628. PMLR (2020)"},{"key":"21_CR4","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optimization","author":"SP Boyd","year":"2004","unstructured":"Boyd, S.P., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)"},{"key":"21_CR5","unstructured":"Chen, Y., et al.: Coordinated dynamic bidding in repeated second-price auctions with budgets. In: International Conference on Machine Learning, pp. 5052\u20135086. PMLR (2023)"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"Deng, Y., Mao, J., Mirrokni, V., Zuo, S.: Towards efficient auctions in an auto-bidding world. In: Proceedings of the Web Conference 2021, pp. 3965\u20133973 (2021)","DOI":"10.1145\/3442381.3450052"},{"issue":"2","key":"21_CR7","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1145\/1998549.1998558","volume":"10","author":"NR Devanur","year":"2011","unstructured":"Devanur, N.R.: Online algorithms with stochastic input. ACM SIGecom Exchanges 10(2), 40\u201349 (2011)","journal-title":"ACM SIGecom Exchanges"},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"Devanur, N.R., Hayes, T.P.: The adwords problem: online keyword matching with budgeted bidders under random permutations. In: Proceedings of the 10th ACM Conference on Electronic Commerce, pp. 71\u201378 (2009)","DOI":"10.1145\/1566374.1566384"},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"Devanur, N.R., Jain, K.: Online matching with concave returns. In: Proceedings of the Forty-Fourth Annual ACM Symposium on Theory of Computing, pp. 137\u2013144 (2012)","DOI":"10.1145\/2213977.2213992"},{"key":"21_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/978-3-642-15775-2_16","volume-title":"Algorithms \u2013 ESA 2010","author":"J Feldman","year":"2010","unstructured":"Feldman, J., Henzinger, M., Korula, N., Mirrokni, V.S., Stein, C.: Online stochastic packing applied to display ad allocation. In: de Berg, M., Meyer, U. (eds.) ESA 2010. LNCS, vol. 6346, pp. 182\u2013194. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15775-2_16"},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"Feng, Z., Padmanabhan, S., Wang, D.: Online bidding algorithms for return-on-spend constrained advertisers*. In: Proceedings of the ACM Web Conference 2023, pp. 3550\u20133560 (2023)","DOI":"10.1145\/3543507.3583491"},{"key":"21_CR12","unstructured":"Golrezaei, N., Jaillet, P., Liang, J.C.N., Mirrokni, V.: Bidding and pricing in budget and roi constrained markets, 8(8.1), 3 (2021). arXiv preprint arXiv:2107.07725"},{"key":"21_CR13","unstructured":"Han, Y., Zhou, Z., Weissman, T.: Optimal no-regret learning in repeated first-price auctions. arXiv preprint arXiv:2003.09795 (2020)"},{"key":"21_CR14","doi-asserted-by":"crossref","unstructured":"Karp, R.M., Vazirani, U.V., Vazirani, V.V.: An optimal algorithm for on-line bipartite matching. In: Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing, pp. 352\u2013358 (1990)","DOI":"10.1145\/100216.100262"},{"key":"21_CR15","unstructured":"Kleinberg, R.D.: A multiple-choice secretary algorithm with applications to online auctions. In: SODA, vol.\u00a05, pp. 630\u2013631. Citeseer (2005)"},{"key":"21_CR16","doi-asserted-by":"crossref","unstructured":"Mehta, A., Saberi, A., Vazirani, U., Vazirani, V.: Adwords and generalized online matching. J. ACM (JACM) 54(5), 22\u2013es (2007)","DOI":"10.1145\/1284320.1284321"},{"issue":"1","key":"21_CR17","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1287\/moor.2013.0612","volume":"39","author":"M Molinaro","year":"2014","unstructured":"Molinaro, M., Ravi, R.: The geometry of online packing linear programs. Math. Oper. Res. 39(1), 46\u201359 (2014)","journal-title":"Math. Oper. Res."},{"issue":"3","key":"21_CR18","first-page":"331","volume":"23","author":"C Neagu","year":"2016","unstructured":"Neagu, C., et al.: The importance and role of small and medium-sized businesses. Theor. Appl. Econ. 23(3), 331\u2013338 (2016)","journal-title":"Theor. Appl. Econ."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-1090-7_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T07:08:04Z","timestamp":1757142484000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-1090-7_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819610891","9789819610907"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-1090-7_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"5 March 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shanghai","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 August 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/anl.sjtu.edu.cn\/cocoon2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}