{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T07:20:25Z","timestamp":1743146425342,"version":"3.40.3"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031228315"},{"type":"electronic","value":"9783031228322"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-22832-2_3","type":"book-chapter","created":{"date-parts":[[2022,12,8]],"date-time":"2022-12-08T09:05:33Z","timestamp":1670490333000},"page":"41-59","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Online Allocation and\u00a0Display Ads Optimization with\u00a0Surplus Supply"],"prefix":"10.1007","author":[{"given":"Melika","family":"Abolhassani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hossein","family":"Esfandiari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yasamin","family":"Nazari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Balasubramanian","family":"Sivan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yifeng","family":"Teng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Creighton","family":"Thomas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,12,9]]},"reference":[{"key":"3_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/978-3-319-13129-0_16","volume-title":"Web and Internet Economics","author":"G Aggarwal","year":"2014","unstructured":"Aggarwal, G., Cai, Y., Mehta, A., Pierrakos, G.: Biobjective online bipartite matching. In: Liu, T.-Y., Qi, Q., Ye, Y. (eds.) WINE 2014. LNCS, vol. 8877, pp. 218\u2013231. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-13129-0_16"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Aggarwal, G., Goel, G., Karande, C., Mehta, A.: Online vertex-weighted bipartite matching and single-bid budgeted allocations. In: Randall, D. (ed.) Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, San Francisco, California, USA, 23\u201325 January 2011, pp. 1253\u20131264. SIAM (2011)","DOI":"10.1137\/1.9781611973082.95"},{"key":"3_CR3","unstructured":"Agrawal, S., Devanur, N.R.: Fast algorithms for online stochastic convex programming. In: Indyk, P. (ed.) 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. SIAM (2015)"},{"issue":"4","key":"3_CR4","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."},{"issue":"12","key":"3_CR5","doi-asserted-by":"publisher","first-page":"2886","DOI":"10.1287\/mnsc.2014.2017","volume":"60","author":"SR Balseiro","year":"2014","unstructured":"Balseiro, S.R., Feldman, J., Mirrokni, V.S., Muthukrishnan, S.: Yield optimization of display advertising with ad exchange. Manag. Sci. 60(12), 2886\u20132907 (2014)","journal-title":"Manag. Sci."},{"key":"3_CR6","unstructured":"Balseiro, S.R., Lu, H., Mirrokni, V.S.: Dual mirror descent for online allocation problems. In: Proceedings of the 37th International Conference on Machine Learning, ICML 2020, July 13\u201318 2020, Virtual Event. Proceedings of Machine Learning Research, vol. 119, pp. 613\u2013628. PMLR (2020)"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Blanc, G., Charikar, M.: Multiway online correlated selection. In: 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS), pp. 1277\u20131284. IEEE (2022)","DOI":"10.1109\/FOCS52979.2021.00124"},{"issue":"2","key":"3_CR8","doi-asserted-by":"publisher","first-page":"556","DOI":"10.1287\/isre.2019.0902","volume":"31","author":"H Choi","year":"2020","unstructured":"Choi, H., Mela, C.F., Balseiro, S.R., Leary, A.: Online display advertising markets: a literature review and future directions. Inf. Syst. Res. 31(2), 556\u2013575 (2020)","journal-title":"Inf. Syst. Res."},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Cohen, I.R., Wajc, D.: Randomized online matching in regular graphs. In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 960\u2013979. SIAM (2018)","DOI":"10.1137\/1.9781611975031.62"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Derakhshan, M., Golrezaei, N., Leme, R.P.: Lp-based approximation for personalized reserve prices. In: Karlin, A., Immorlica, N., Johari, R. (eds.) Proceedings of the 2019 ACM Conference on Economics and Computation, EC 2019, Phoenix, AZ, USA, 24\u201328 June 2019, p. 589. ACM (2019)","DOI":"10.1145\/3328526.3329594"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Devanur, N.R., Hayes, T.P.: The adwords problem: online keyword matching with budgeted bidders under random permutations. In: Chuang, J., Fortnow, L., Pu, P. (eds.) Proceedings 10th ACM Conference on Electronic Commerce (EC-2009), Stanford, California, USA, 6\u201310 July 2009, pp. 71\u201378. ACM (2009)","DOI":"10.1145\/1566374.1566384"},{"key":"3_CR12","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":"3_CR13","doi-asserted-by":"crossref","unstructured":"Devanur, N.R., Jain, K., Kleinberg, R.D.: Randomized primal-dual analysis of RANKING for online bipartite matching. In: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, New Orleans, Louisiana, USA, 6\u20138 January 2013, pp. 101\u2013107. SIAM (2013)","DOI":"10.1137\/1.9781611973105.7"},{"issue":"1","key":"3_CR14","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-7:41 (2019)","journal-title":"J. ACM"},{"key":"3_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/978-3-319-18263-6_14","volume-title":"Approximation and Online Algorithms","author":"W Dvo\u00e1k","year":"2015","unstructured":"Dvo\u00e1k, W., Henzinger, M.: Online ad assignment with an ad exchange. In: Bampis, E., Svensson, O. (eds.) WAOA 2014. LNCS, vol. 8952, pp. 156\u2013167. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-18263-6_14"},{"key":"3_CR16","first-page":"2739","volume":"29","author":"H Esfandiari","year":"2016","unstructured":"Esfandiari, H., Korula, N., Mirrokni, V.: Bi-objective online matching and submodular allocations. Adv. Neural. Inf. Process. Syst. 29, 2739\u20132747 (2016)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"issue":"3\u20134","key":"3_CR17","first-page":"1","volume":"6","author":"H Esfandiari","year":"2018","unstructured":"Esfandiari, H., Korula, N., Mirrokni, V.: Allocation with traffic spikes: mixing adversarial and stochastic models. ACM Trans. Econ. Comput. (TEAC) 6(3\u20134), 1\u201323 (2018)","journal-title":"ACM Trans. Econ. Comput. (TEAC)"},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Fahrbach, M., Huang, Z., Tao, R., Zadimoghaddam, M.: Edge-weighted online bipartite matching. In: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), pp. 412\u2013423. IEEE (2020)","DOI":"10.1109\/FOCS46700.2020.00046"},{"key":"3_CR19","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":"3_CR20","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). https:\/\/doi.org\/10.1007\/978-3-642-10841-9_34"},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"Gao, R., He, Z., Huang, Z., Nie, Z., Yuan, B., Zhong, Y.: Improved online correlated selection. In: 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS), pp. 1265\u20131276. IEEE (2022)","DOI":"10.1109\/FOCS52979.2021.00123"},{"key":"3_CR22","doi-asserted-by":"crossref","unstructured":"Huang, Z., Zhang, Q., Zhang, Y.: Adwords in a panorama. In: 61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020, Durham, NC, USA, 16\u201319 November 2020, pp. 1416\u20131426. IEEE (2020)","DOI":"10.1109\/FOCS46700.2020.00133"},{"issue":"1\u20132","key":"3_CR23","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/S0304-3975(99)00140-1","volume":"233","author":"B Kalyanasundaram","year":"2000","unstructured":"Kalyanasundaram, B., Pruhs, K.: An optimal deterministic algorithm for online b-matching. Theor. Comput. Sci. 233(1\u20132), 319\u2013325 (2000)","journal-title":"Theor. Comput. Sci."},{"key":"3_CR24","doi-asserted-by":"crossref","unstructured":"Karande, C., Mehta, A., Tripathi, P.: Online bipartite matching with unknown distributions. In: Proceedings of the Forty-Third Annual ACM Symposium on Theory of Computing, pp. 587\u2013596 (2011)","DOI":"10.1145\/1993636.1993715"},{"key":"3_CR25","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":"3_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/978-3-642-45046-4_25","volume-title":"Web and Internet Economics","author":"N Korula","year":"2013","unstructured":"Korula, N., Mirrokni, V.S., Zadimoghaddam, M.: Bicriteria online matching: maximizing weight and cardinality. In: Chen, Y., Immorlica, N. (eds.) WINE 2013. LNCS, vol. 8289, pp. 305\u2013318. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-45046-4_25"},{"key":"3_CR27","unstructured":"Leme, R.P., P\u00e1l, M., Vassilvitskii, S.: A field guide to personalized reserve prices. In: Bourdeau, J., Hendler, J., Nkambou, R., Horrocks, I., Zhao, B.Y. (eds.) Proceedings of the 25th International Conference on World Wide Web, WWW 2016, Montreal, Canada, 11\u201315 April 2016, pp. 1093\u20131102. ACM (2016)"},{"issue":"4","key":"3_CR28","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1561\/0400000057","volume":"8","author":"A Mehta","year":"2013","unstructured":"Mehta, A.: Online matching and ad allocation. Found. Trends Theor. Comput. Sci. 8(4), 265\u2013368 (2013)","journal-title":"Found. Trends Theor. Comput. Sci."},{"key":"3_CR29","doi-asserted-by":"crossref","unstructured":"Mehta, A., Saberi, A., Vazirani, U., Vazirani, V.: Adwords and generalized online matching. Journal of the ACM (JACM) 54(5), 22-es (2007)","DOI":"10.1145\/1284320.1284321"},{"key":"3_CR30","doi-asserted-by":"crossref","unstructured":"Mirrokni, V.S., Gharan, S.O., Zadimoghaddam, M.: Simultaneous approximations for adversarial and stochastic online budgeted allocation. In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012, Kyoto, Japan, January 17\u201319, 2012. pp. 1690\u20131701. SIAM (2012)","DOI":"10.1137\/1.9781611973099.134"},{"issue":"3\u20134","key":"3_CR31","first-page":"1","volume":"6","author":"J Naor","year":"2018","unstructured":"Naor, J., Wajc, D.: Near-optimum online ad allocation for targeted advertising. ACM Transactions on Economics and Computation (TEAC) 6(3\u20134), 1\u201320 (2018)","journal-title":"ACM Transactions on Economics and Computation (TEAC)"},{"key":"3_CR32","unstructured":"Shin, Y., An, H.C.: Making three out of two: Three-way online correlated selection. arXiv preprint arXiv:2107.02605 (2021)"}],"container-title":["Lecture Notes in Computer Science","Web and Internet Economics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22832-2_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T18:46:25Z","timestamp":1710269185000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22832-2_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031228315","9783031228322"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22832-2_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"9 December 2022","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":"Troy, 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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 December 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wine2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cs.rpi.edu\/wine2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"126","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"19","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"15% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"19 abstracts in the back matter","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}