{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T00:35:17Z","timestamp":1760056517187,"version":"build-2065373602"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031931116"},{"type":"electronic","value":"9783031931123"}],"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-3-031-93112-3_24","type":"book-chapter","created":{"date-parts":[[2025,6,10]],"date-time":"2025-06-10T04:55:54Z","timestamp":1749531354000},"page":"326-340","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Black-Box Approach for\u00a0Exogenous Replenishment in\u00a0Online Resource Allocation"],"prefix":"10.1007","author":[{"given":"Suho","family":"Kang","sequence":"first","affiliation":[]},{"given":"Ziyang","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Rajan","family":"Udwani","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,6,4]]},"reference":[{"key":"24_CR1","doi-asserted-by":"crossref","unstructured":"Alaei, S., Hajiaghayi, M., Liaghat, V.: Online prophet-inequality matching with applications to ad allocation, pp. 18\u201335 (2012)","DOI":"10.1145\/2229012.2229018"},{"issue":"2","key":"24_CR2","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1287\/moor.1080.0364","volume":"34","author":"CW Chan","year":"2009","unstructured":"Chan, C.W., Farias, V.F.: Stochastic depletion problems: effective myopic policies for a class of dynamic optimization problems. Math. Oper. Res. 34(2), 333\u2013350 (2009)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"24_CR3","doi-asserted-by":"publisher","first-page":"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 (JACM) 66(1), 1\u201341 (2019)","journal-title":"J. ACM (JACM)"},{"key":"24_CR4","doi-asserted-by":"crossref","unstructured":"Ekbatani, F., Feng, Y., Kash, I., Niazadeh, R.: Online job assignment. Available at SSRN (2024)","DOI":"10.2139\/ssrn.4745629"},{"key":"24_CR5","unstructured":"Feng, Y., Niazadeh, R., Saberi, A.: Robustness of online inventory balancing algorithm to inventory shocks. Available at SSRN 3795056 (2021)"},{"issue":"5","key":"24_CR6","doi-asserted-by":"publisher","first-page":"1861","DOI":"10.1287\/opre.2020.0687","volume":"72","author":"Y Feng","year":"2024","unstructured":"Feng, Y., Niazadeh, R., Saberi, A.: Near-optimal Bayesian online assortment of reusable resources. Oper. Res. 72(5), 1861\u20131873 (2024)","journal-title":"Oper. Res."},{"issue":"6","key":"24_CR7","doi-asserted-by":"publisher","first-page":"1532","DOI":"10.1287\/mnsc.2014.1939","volume":"60","author":"N Golrezaei","year":"2014","unstructured":"Golrezaei, N., Nazerzadeh, H., Rusmevichientong, P.: Real-time optimization of personalized assortments. Manage. Sci. 60(6), 1532\u20131551 (2014)","journal-title":"Manage. Sci."},{"key":"24_CR8","unstructured":"Goyal, V., Iyengar, G., Udwani, R.: Asymptotically optimal competitive ratio for online allocation of reusable resources. arXiv preprint: arXiv:2002.02430, 2020"},{"issue":"2","key":"24_CR9","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1287\/opre.2022.2345","volume":"71","author":"V Goyal","year":"2023","unstructured":"Goyal, V., Udwani, R.: Online matching with stochastic rewards: optimal competitive ratio via path-based formulation. Oper. Res. 71(2), 563\u2013580 (2023)","journal-title":"Oper. Res."},{"key":"24_CR10","doi-asserted-by":"crossref","unstructured":"Huang, Z., Tang, Z.G., Wajc, D.: Online matching: a brief survey. arXiv preprint: arXiv:2407.05381, 2024","DOI":"10.1145\/3699824.3699837"},{"key":"24_CR11","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":"24_CR12","doi-asserted-by":"crossref","unstructured":"Mehta, A.: Online matching and ad allocation. Found. Trends\u00ae Theor. Comput. Sci. 8(4), 265\u2013368 (2013)","DOI":"10.1561\/0400000057"},{"key":"24_CR13","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":"7","key":"24_CR14","doi-asserted-by":"publisher","first-page":"2820","DOI":"10.1287\/mnsc.2019.3346","volume":"66","author":"P Rusmevichientong","year":"2020","unstructured":"Rusmevichientong, P., Sumida, M., Topaloglu, H.: Dynamic assortment optimization for reusable products with random usage durations. Manage. Sci. 66(7), 2820\u20132844 (2020)","journal-title":"Manage. Sci."},{"key":"24_CR15","doi-asserted-by":"crossref","unstructured":"Talluri, K., Van Ryzin, G.: An analysis of bid-price controls for network revenue management. Manage. Sci. 44(11-part-1), 1577\u20131593 (1998)","DOI":"10.1287\/mnsc.44.11.1577"},{"key":"24_CR16","doi-asserted-by":"crossref","unstructured":"Tr\u00f6bst, T., Udwani, R.: Almost tight bounds for online hypergraph matching. arXiv preprint: arXiv:2402.08775 (2024)","DOI":"10.1016\/j.orl.2024.107143"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-93112-3_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T10:53:37Z","timestamp":1760007217000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-93112-3_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031931116","9783031931123"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-93112-3_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"4 June 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IPCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integer Programming and Combinatorial Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Baltimore, MD","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":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 June 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ipco2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ipco25.cs.jhu.edu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}