{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T19:04:04Z","timestamp":1757617444201,"version":"3.44.0"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031826696"},{"type":"electronic","value":"9783031826702"}],"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-82670-2_4","type":"book-chapter","created":{"date-parts":[[2025,2,6]],"date-time":"2025-02-06T04:39:54Z","timestamp":1738816794000},"page":"37-50","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Online b-Matching with\u00a0Stochastic Rewards"],"prefix":"10.1007","author":[{"given":"Susanne","family":"Albers","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sebastian","family":"Schubert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,2,7]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Aggarwal, G., Goel, G., Karande, C., Mehta, A.: Online vertex-weighted bipartite matching and single-bid budgeted allocations. In: Proceedings of 22nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1253\u20131264. SIAM (2011)","DOI":"10.1137\/1.9781611973082.95"},{"issue":"1","key":"4_CR2","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1145\/1360443.1360462","volume":"39","author":"B Birnbaum","year":"2008","unstructured":"Birnbaum, B., Mathieu, C.: On-line bipartite matching made simple. SIGACT News 39(1), 80\u201387 (2008)","journal-title":"SIGACT News"},{"key":"4_CR3","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). https:\/\/doi.org\/10.1007\/978-3-540-75520-3_24"},{"key":"4_CR4","doi-asserted-by":"publisher","unstructured":"Buchbinder, N., Naor, J., Wajc, D.: Lossless online rounding for online bipartite matching (despite its impossibility). In: Proceedings of 34th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 2030\u20132068. SIAM (2023). https:\/\/doi.org\/10.1137\/1.9781611977554.ch78","DOI":"10.1137\/1.9781611977554.ch78"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Devanur, N., Jain, K., Kleinberg, R.: Randomized primal-dual analysis of RANKING for online bipartite matching. In: Proceedings of 24th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 101\u2013107 (2013)","DOI":"10.1137\/1.9781611973105.7"},{"issue":"6","key":"4_CR6","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. Manag. Sci. 60(6), 1532\u20131551 (2014). https:\/\/doi.org\/10.1287\/mnsc.2014.1939","journal-title":"Manag. Sci."},{"issue":"2","key":"4_CR7","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). https:\/\/doi.org\/10.1287\/opre.2022.2345","journal-title":"Oper. Res."},{"key":"4_CR8","doi-asserted-by":"publisher","unstructured":"Huang, Z., Jiang, H., Shen, A., Song, J., Wu, Z., Zhang, Q.: Online matching with stochastic rewards: advanced analyses using configuration linear programs. In: Proceedings of 19th International Conference on Web and Internet Economics (WINE). Lecture Notes in Computer Science, vol. 14413, pp. 384\u2013401. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-48974-7_22","DOI":"10.1007\/978-3-031-48974-7_22"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Huang, Z., Tr\u00f6bst, T.: Applications of online matching. In: Echenique, F., Immorlica, N., Vazirani, V. (eds.) Online and Matching-Based Market Design, pp. 109\u2013129. Cambridge University Press (2023)","DOI":"10.1017\/9781108937535.005"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Huang, Z., Zhang, Q.: Online primal dual meets online matching with stochastic rewards: configuration LP to the rescue. In: Proceedings of 52nd Annual ACM SIGACT Symposium on Theory of Computing (STOC), pp. 1153\u20131164 (2020)","DOI":"10.1145\/3357713.3384294"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Huang, Z., Zhang, Q., Zhang, Y.: Adwords in a panorama. In: Proceedings of 61st IEEE Annual Symposium on Foundations of Computer Science (FOCS), pp. 1416\u20131426 (2020)","DOI":"10.1109\/FOCS46700.2020.00133"},{"issue":"1\u20132","key":"4_CR12","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":"4_CR13","doi-asserted-by":"crossref","unstructured":"Karp, R., Vazirani, U., Vazirani, V.: An optimal algorithm for on-line bipartite matching. In: Proceedings of 22nd Annual ACM Symposium on Theory of Computing (STOC), pp. 352\u2013358 (1990)","DOI":"10.1145\/100216.100262"},{"issue":"4","key":"4_CR14","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). https:\/\/doi.org\/10.1561\/0400000057","journal-title":"Found. Trends Theor. Comput. Sci."},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Mehta, A., Panigrahi, D.: Online matching with stochastic rewards. In: Proceedings of 53rd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 728\u2013737 (2012)","DOI":"10.1109\/FOCS.2012.65"},{"issue":"5","key":"4_CR16","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":"4_CR17","doi-asserted-by":"publisher","unstructured":"Mehta, A., Waggoner, B., Zadimoghaddam, M.: Online stochastic matching with unequal probabilities. In: Proceedings of 26th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1388\u20131404. SIAM (2015). https:\/\/doi.org\/10.1137\/1.9781611973730.92","DOI":"10.1137\/1.9781611973730.92"},{"key":"4_CR18","doi-asserted-by":"publisher","unstructured":"Udwani, R.: Adwords with unknown budgets and beyond. In: Proceedings of 24th ACM Conference on Economics and Computation (RC), p.\u00a01128. ACM (2023). https:\/\/doi.org\/10.1145\/3580507.3597724","DOI":"10.1145\/3580507.3597724"},{"key":"4_CR19","doi-asserted-by":"publisher","unstructured":"Udwani, R.: When stochastic rewards reduce to deterministic rewards in online bipartite matching. In: Proceedings of 6th Symposium on Simplicity in Algorithms (SOSA), pp. 321\u2013330. SIAM (2024). https:\/\/doi.org\/10.1137\/1.9781611977936.29,","DOI":"10.1137\/1.9781611977936.29"},{"key":"4_CR20","unstructured":"Zhang, Q., Shen, A., Zhang, B., Jiang, H., Du, B.: Online matching with stochastic rewards: provable better bound via adversarial reinforcement learning. In: Forty-First International Conference on Machine Learning, ICML 2024, Vienna, Austria, 21\u201327 July 2024. OpenReview.net (2024). https:\/\/openreview.net\/forum?id=TujtZgdRxB"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2025: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-82670-2_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T04:40:16Z","timestamp":1757133616000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-82670-2_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031826696","9783031826702"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-82670-2_4","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":"7 February 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SOFSEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Current Trends in Theory and Practice of Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bratislava","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Slovakia","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":"21 January 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 January 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"50","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sofsem2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.sofsem.sk","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}