{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T02:29:09Z","timestamp":1767320949175,"version":"3.48.0"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032085597","type":"print"},{"value":"9783032085603","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-08560-3_5","type":"book-chapter","created":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T02:24:15Z","timestamp":1767320655000},"page":"84-101","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Online Matching Meets Sampling Without Replacement"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2963-9556","authenticated-orcid":false,"given":"Zhiyi","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9694-0838","authenticated-orcid":false,"given":"Chui Shan","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4147-9057","authenticated-orcid":false,"given":"Jianqiao","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5481-6553","authenticated-orcid":false,"given":"Xinkai","family":"Shu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,1,2]]},"reference":[{"key":"5_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 the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1253\u20131264. SIAM (2011)","DOI":"10.1137\/1.9781611973082.95"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal, S., Devanur, N.R.: Fast algorithms for online stochastic convex programming. In: Proceedings of the 26th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1405\u20131424. SIAM (2015)","DOI":"10.1137\/1.9781611973730.93"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Aouad, A., Ma, W.: A nonparametric framework for online stochastic matching with correlated arrivals. In: Proceedings of the 24th ACM Conference on Economics and Computation, p.\u00a0114. ACM, New York (2023)","DOI":"10.1145\/3580507.3597773"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Bahmani, B., Kapralov, M.: Improved bounds for online stochastic matching. In: Proceedings of the 18th Annual European Symposium on Algorithms, pp. 170\u2013181. Springer (2010)","DOI":"10.1007\/978-3-642-15775-2_15"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Blanc, G., Charikar, M.: Multiway online correlated selection. In: Proceedings of the 62nd Annual IEEE Symposium on Foundations of Computer Science, pp. 1277\u20131284. IEEE (2021)","DOI":"10.1109\/FOCS52979.2021.00124"},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3379552","volume":"25","author":"A Borodin","year":"2020","unstructured":"Borodin, A., Karavasilis, C., Pankratov, D.: An experimental study of algorithms for online bipartite matching. J. Exper. Algorithmics 25, 1\u201337 (2020)","journal-title":"J. Exper. Algorithmics"},{"key":"5_CR7","unstructured":"Brubach, B., Sankararaman, K.A., Srinivasan, A., Xu, P.: New algorithms, better bounds, and a novel model for online stochastic matching. In: Proceedings of the 24th Annual European Symposium on Algorithms. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2016)"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Buchbinder, N., Jain, K., Naor, J.: Online primal-dual algorithms for maximizing ad-auctions revenue. In: Proceedings of the 15th Annual European Symposium on Algorithms, pp. 253\u2013264. Springer (2007)","DOI":"10.1007\/978-3-540-75520-3_24"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Buchbinder, N., Naor, J., Wajc, D.: Lossless online rounding for online bipartite matching (despite its impossibility). In: Proceedings of the 34th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 2030\u20132068. SIAM (2023)","DOI":"10.1137\/1.9781611977554.ch78"},{"key":"5_CR10","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"},{"issue":"3","key":"5_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2892563","volume":"4","author":"NR Devanur","year":"2016","unstructured":"Devanur, N.R., Huang, Z., Korula, N., Mirrokni, V.S., Yan, Q.: Whole-page optimization and submodular welfare maximization with online bidders. ACM Trans. Econ. Comput. 4(3), 1\u201320 (2016)","journal-title":"ACM Trans. Econ. Comput."},{"key":"5_CR12","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 24th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 101\u2013107. SIAM (2013)","DOI":"10.1137\/1.9781611973105.7"},{"issue":"6","key":"5_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3556971","volume":"69","author":"M Fahrbach","year":"2022","unstructured":"Fahrbach, M., Huang, Z., Tao, R., Zadimoghaddam, M.: Edge-weighted online bipartite matching. J. ACM 69(6), 1\u201335 (2022)","journal-title":"J. ACM"},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"Feldman, J., Mehta, A., Mirrokni, V., Muthukrishnan, S.: Online stochastic matching: beating $$1-\\frac{1}{e}$$. In: Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, pp. 117\u2013126. IEEE (2009)","DOI":"10.1109\/FOCS.2009.72"},{"key":"5_CR15","unstructured":"Feng, Y., Qiu, G., Wu, X., Zhou, S.: Improved competitive ratio for edge-weighted online stochastic matching. arXiv preprint arXiv:2302.05633 (2023)"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Gao, R., He, Z., Huang, Z., Nie, Z., Yuan, B., Zhong, Y.: Improved online correlated selection. In: Proceedings of the 62nd Annual IEEE Symposium on Foundations of Computer Science, pp. 1265\u20131276. IEEE (2021)","DOI":"10.1109\/FOCS52979.2021.00123"},{"key":"5_CR17","unstructured":"Goel, G., Mehta, A.: Online budgeted matching in random input models with applications to AdWords. In: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 982\u2013991 (2008)"},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"Haeupler, B., Mirrokni, V.S., Zadimoghaddam, M.: Online stochastic weighted matching: improved approximation algorithms. In: Proceedings of the 7th International Workshop on Internet and Network Economics, pp., pp. 170\u2013181. Springer (2011)","DOI":"10.1007\/978-3-642-25510-6_15"},{"key":"5_CR19","unstructured":"Huang, Z., Lee, C.S., Lu, J., Shu, X.: Online matching meets sampling without replacement. arXiv preprint arXiv:2410.06868 (2024)"},{"key":"5_CR20","doi-asserted-by":"crossref","unstructured":"Huang, Z., Shu, X.: Online stochastic matching, Poisson arrivals, and the natural linear program. In: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, pp. 682\u2013693 (2021)","DOI":"10.1145\/3406325.3451079"},{"key":"5_CR21","doi-asserted-by":"crossref","unstructured":"Huang, Z., Shu, X., Yan, S.: The power of multiple choices in online stochastic matching. In: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, pp. 91\u2013103 (2022)","DOI":"10.1145\/3519935.3520046"},{"issue":"3","key":"5_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3326169","volume":"15","author":"Z Huang","year":"2019","unstructured":"Huang, Z., Tang, Z.G., Wu, X., Zhang, Y.: Online vertex-weighted bipartite matching: Beating $$1-\\frac{1}{e}$$ with random arrivals. ACM Trans. Algorithms 15(3), 1\u201315 (2019)","journal-title":"ACM Trans. Algorithms"},{"key":"5_CR23","doi-asserted-by":"crossref","unstructured":"Huang, Z., Zhang, Q., Zhang, Y.: Adwords in a panorama. In: Proceedings of the 61st Annual IEEE Symposium on Foundations of Computer Science, pp. 1416\u20131426. IEEE (2020)","DOI":"10.1109\/FOCS46700.2020.00133"},{"issue":"3","key":"5_CR24","doi-asserted-by":"publisher","first-page":"624","DOI":"10.1287\/moor.2013.0621","volume":"39","author":"P Jaillet","year":"2014","unstructured":"Jaillet, P., Lu, X.: Online stochastic matching: new algorithms with better bounds. Math. Oper. Res. 39(3), 624\u2013646 (2014)","journal-title":"Math. Oper. Res."},{"key":"5_CR25","doi-asserted-by":"crossref","unstructured":"Jin, B., Williamson, D.P.: Improved analysis of RANKING for online vertex-weighted bipartite matching in the random order model. In: Proceedings of the 17th International Conference on Web and Internet Economics, pp. 207\u2013225. Springer (2022)","DOI":"10.1007\/978-3-030-94676-0_12"},{"issue":"1\u20132","key":"5_CR26","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.R.: An optimal deterministic algorithm for online $$b$$-matching. Theoret. Comput. Sci. 233(1\u20132), 319\u2013325 (2000)","journal-title":"Theoret. Comput. Sci."},{"key":"5_CR27","doi-asserted-by":"crossref","unstructured":"Karande, C., Mehta, A., Tripathi, P.: Online bipartite matching with unknown distributions. In: Proceedings of the 43rd Annual ACM Symposium on Theory of Computing, pp. 587\u2013596 (2011)","DOI":"10.1145\/1993636.1993715"},{"key":"5_CR28","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 22nd Annual ACM Symposium on Theory of Computing, pp. 352\u2013358 (1990)","DOI":"10.1145\/100216.100262"},{"key":"5_CR29","doi-asserted-by":"crossref","unstructured":"Kesselheim, T., Radke, K., T\u00f6nnis, A., V\u00f6cking, B.: An optimal online algorithm for weighted bipartite matching and extensions to combinatorial auctions. In: Proceedings of the 21st Annual European Symposium on Algorithms, pp. 589\u2013600. Springer (2013)","DOI":"10.1007\/978-3-642-40450-4_50"},{"issue":"5","key":"5_CR30","doi-asserted-by":"publisher","first-page":"1939","DOI":"10.1137\/15M1033708","volume":"47","author":"T Kesselheim","year":"2018","unstructured":"Kesselheim, T., Radke, K., T\u00f6nnis, A., V\u00f6cking, B.: Primal beats dual on online packing LPs in the random-order model. SIAM J. Comput. 47(5), 1939\u20131964 (2018)","journal-title":"SIAM J. Comput."},{"key":"5_CR31","doi-asserted-by":"crossref","unstructured":"Ma, W., Xu, P., Xu, Y.: Fairness maximization among offline agents in online-matching markets. In: Proceedings of the 17th International Workshop on Internet and Network Economics, pp. 16\u201327. Springer (2023)","DOI":"10.1145\/3569705"},{"key":"5_CR32","doi-asserted-by":"crossref","unstructured":"Mahdian, M., Yan, Q.: Online bipartite matching with random arrivals: an approach based on strongly factor-revealing LPs. In: Proceedings of the 43rd Annual ACM Symposium on Theory of Computing, pp. 597\u2013606 (2011)","DOI":"10.1145\/1993636.1993716"},{"issue":"4","key":"5_CR33","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1287\/moor.1120.0551","volume":"37","author":"VH Manshadi","year":"2012","unstructured":"Manshadi, V.H., Oveis Gharan, S., Saberi, A.: Online stochastic matching: online actions based on offline statistics. Math. Oper. Res. 37(4), 559\u2013573 (2012)","journal-title":"Math. Oper. Res."},{"key":"5_CR34","doi-asserted-by":"crossref","unstructured":"Mehta, A., Saberi, A., Vazirani, U., Vazirani, V.: Adwords and generalized online matching. J. ACM 54(5), 22\u2013es (2007)","DOI":"10.1145\/1284320.1284321"},{"key":"5_CR35","unstructured":"Naor, J.S., Srinivasan, A., Wajc, D.: Online dependent rounding schemes. arXiv preprint arXiv:2301.08680 (2023)"},{"key":"5_CR36","unstructured":"Shin, Y., An, H.C.: Making three out of two: Three-way online correlated selection. In: Proceedings of the 32nd International Symposium on Algorithms and Computation. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2021)"},{"key":"5_CR37","doi-asserted-by":"crossref","unstructured":"Tang, Z.G., Wu, J., Wu, H.: (Fractional) online stochastic matching via fine-grained offline statistics. In: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, pp. 77\u201390 (2022)","DOI":"10.1145\/3519935.3519994"},{"key":"5_CR38","unstructured":"Yan, S.: Edge-weighted online stochastic matching: beating $$1-\\frac{1}{e}$$. arXiv preprint arXiv:2210.12543 (2022)"}],"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-032-08560-3_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T02:24:17Z","timestamp":1767320657000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-08560-3_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032085597","9783032085603"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-08560-3_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"2 January 2026","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":"Edinburgh","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","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":"2 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wine2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/wine2024.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}