{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T18:37:04Z","timestamp":1770921424819,"version":"3.50.1"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032178008","type":"print"},{"value":"9783032178015","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-17801-5_27","type":"book-chapter","created":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T17:53:33Z","timestamp":1770918813000},"page":"361-375","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Learning-Augmented Online Bipartite Matching in\u00a0the\u00a0Random Arrival Order Model"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-5262-9300","authenticated-orcid":false,"given":"Kunanon","family":"Burathep","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4470-5868","authenticated-orcid":false,"given":"Thomas","family":"Erlebach","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4533-7593","authenticated-orcid":false,"given":"William K.","family":"Moses","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,2,13]]},"reference":[{"key":"27_CR1","first-page":"5724","volume":"35","author":"A Aamand","year":"2022","unstructured":"Aamand, A., Chen, J., Indyk, P.: (Optimal) online bipartite matching with degree information. Adv. Neural. Inf. Process. Syst. 35, 5724\u20135737 (2022)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"27_CR2","unstructured":"Anand, K., Ge, R., Panigrahi, D.: Customizing ml predictions for online algorithms. In: International Conference on Machine Learning, pp. 303\u2013313. PMLR (2020)"},{"key":"27_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2024.103545","volume":"144","author":"S Angelopoulos","year":"2024","unstructured":"Angelopoulos, S., D\u00fcrr, C., Jin, S., Kamali, S., Renault, M.: Online computation with untrusted advice. J. Comput. Syst. Sci. 144, 103545 (2024)","journal-title":"J. Comput. Syst. Sci."},{"key":"27_CR4","unstructured":"Antoniadis, A., Gouleakis, T., Kleer, P., Kolev, P.: Secretary and online matching problems with machine learned advice. In: Larochelle, H., Ranzato, M., Hadsell, R., Balcan, M., Lin, H. (eds.) Advances in Neural Information Processing Systems, vol.\u00a033, pp. 7933\u20137944. Curran Associates, Inc. (2020). https:\/\/proceedings.neurips.cc\/paper_files\/paper\/2020\/file\/5a378f8490c8d6af8647a753812f6e31-Paper.pdf"},{"key":"27_CR5","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. Exp. Algorithmics (JEA) 25, 1\u201337 (2020)","journal-title":"J. Exp. Algorithmics (JEA)"},{"key":"27_CR6","unstructured":"Brubach, B., Sankararaman, K.A., Srinivasan, A., Xu, P.: New algorithms, better bounds, and a novel model for online stochastic matching. In: 24th Annual European Symposium on Algorithms (ESA 2016). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2016)"},{"issue":"10","key":"27_CR7","doi-asserted-by":"publisher","first-page":"2737","DOI":"10.1007\/s00453-020-00698-3","volume":"82","author":"B Brubach","year":"2020","unstructured":"Brubach, B., Sankararaman, K.A., Srinivasan, A., Xu, P.: Online stochastic matching: new algorithms and bounds. Algorithmica 82(10), 2737\u20132783 (2020)","journal-title":"Algorithmica"},{"key":"27_CR8","unstructured":"Burathep, K., Erlebach, T., Moses Jr, W.K.: Learning-augmented online bipartite matching in the random arrival order model. arXiv preprint arXiv:2511.23388 (2025)"},{"key":"27_CR9","unstructured":"Choo, D., Gouleakis, T., Ling, C.K., Bhattacharyya, A.: Online bipartite matching with imperfect advice. In: Salakhutdinov, R., et al. (eds.) Proceedings of the 41st International Conference on Machine Learning. Proceedings of Machine Learning Research, vol.\u00a0235, pp. 8762\u20138781. PMLR (2024). https:\/\/proceedings.mlr.press\/v235\/choo24a.html"},{"issue":"11","key":"27_CR10","doi-asserted-by":"publisher","first-page":"6313","DOI":"10.1073\/pnas.0937490100","volume":"100","author":"F Chung","year":"2003","unstructured":"Chung, F., Lu, L., Vu, V.: Spectra of random graphs with given expected degrees. Proc. Natl. Acad. Sci. 100(11), 6313\u20136318 (2003)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"27_CR11","doi-asserted-by":"crossref","unstructured":"Feldman, J., Mehta, A., Mirrokni, V., Muthukrishnan, S.: Online stochastic matching: Beating 1-1\/e. In: 2009 50th Annual IEEE Symposium on Foundations of Computer Science, pp. 117\u2013126. IEEE (2009)","DOI":"10.1109\/FOCS.2009.72"},{"key":"27_CR12","doi-asserted-by":"crossref","unstructured":"Feng, Y., Niazadeh, R., Saberi, A.: Two-stage stochastic matching with application to ride hailing. In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 2862\u20132877. SIAM (2021)","DOI":"10.1137\/1.9781611976465.170"},{"key":"27_CR13","unstructured":"Goel, G., Mehta, A.: Online budgeted matching in random input models with applications to ADWORDS. In: SODA, vol.\u00a08, pp. 982\u2013991 (2008)"},{"key":"27_CR14","unstructured":"Gollapudi, S., Panigrahi, D.: Online algorithms for rent-or-buy with expert advice. In: International Conference on Machine Learning, pp. 2319\u20132327. PMLR (2019)"},{"issue":"3","key":"27_CR15","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."},{"issue":"10","key":"27_CR16","doi-asserted-by":"publisher","first-page":"6672","DOI":"10.1109\/TIT.2018.2846245","volume":"64","author":"J Jiao","year":"2018","unstructured":"Jiao, J., Han, Y., Weissman, T.: Minimax estimation of the $$l_{1}$$ distance. IEEE Trans. Inf. Theory 64(10), 6672\u20136706 (2018). https:\/\/doi.org\/10.1109\/TIT.2018.2846245","journal-title":"IEEE Trans. Inf. Theory"},{"key":"27_CR17","first-page":"14555","volume":"35","author":"B Jin","year":"2022","unstructured":"Jin, B., Ma, W.: Online bipartite matching with advice: tight robustness-consistency tradeoffs for the two-stage model. Adv. Neural. Inf. Process. Syst. 35, 14555\u201314567 (2022)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"27_CR18","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":"27_CR19","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":"27_CR20","unstructured":"Li, P., Yang, J., Ren, S.: Learning for edge-weighted online bipartite matching with robustness guarantees. In: International Conference on Machine Learning, pp. 20276\u201320295. PMLR (2023)"},{"key":"27_CR21","unstructured":"Lindermayr, A., Megow, N.: Algorithms with predictions (2025). https:\/\/algorithms-with-predictions.github.io"},{"issue":"4","key":"27_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3447579","volume":"68","author":"T Lykouris","year":"2021","unstructured":"Lykouris, T., Vassilvitskii, S.: Competitive caching with machine learned advice. J. ACM (JACM) 68(4), 1\u201325 (2021)","journal-title":"J. ACM (JACM)"},{"key":"27_CR23","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 Forty-Third Annual ACM Symposium on Theory of Computing, pp. 597\u2013606 (2011)","DOI":"10.1145\/1993636.1993716"},{"issue":"4","key":"27_CR24","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1287\/moor.1120.0551","volume":"37","author":"VH Manshadi","year":"2012","unstructured":"Manshadi, V.H., Gharan, S.O., Saberi, A.: Online stochastic matching: online actions based on offline statistics. Math. Oper. Res. 37(4), 559\u2013573 (2012)","journal-title":"Math. Oper. Res."},{"issue":"7","key":"27_CR25","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1145\/3528087","volume":"65","author":"M Mitzenmacher","year":"2022","unstructured":"Mitzenmacher, M., Vassilvitskii, S.: Algorithms with predictions. Commun. ACM 65(7), 33\u201335 (2022)","journal-title":"Commun. ACM"},{"key":"27_CR26","unstructured":"Purohit, M., Svitkina, Z., Kumar, R.: Improving online algorithms via ml predictions. In: Advances in Neural Information Processing Systems, vol. 31 (2018)"},{"key":"27_CR27","doi-asserted-by":"crossref","unstructured":"Rohatgi, D.: Near-optimal bounds for online caching with machine learned advice. In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1834\u20131845. SIAM (2020)","DOI":"10.1137\/1.9781611975994.112"},{"key":"27_CR28","unstructured":"Wei, A.: Better and simpler learning-augmented online caching. arXiv preprint arXiv:2005.13716 (2020)"},{"key":"27_CR29","first-page":"8042","volume":"33","author":"A Wei","year":"2020","unstructured":"Wei, A., Zhang, F.: Optimal robustness-consistency trade-offs for learning-augmented online algorithms. Adv. Neural. Inf. Process. Syst. 33, 8042\u20138053 (2020)","journal-title":"Adv. Neural. Inf. Process. Syst."}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2026: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-17801-5_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T17:53:37Z","timestamp":1770918817000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-17801-5_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032178008","9783032178015"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-17801-5_27","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":"13 February 2026","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":"Krakow","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 February 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 February 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"51","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sofsem2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sofsem.uj.edu.pl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}