{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:19:41Z","timestamp":1759335581968,"version":"3.40.3"},"reference-count":56,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,2,7]],"date-time":"2025-02-07T00:00:00Z","timestamp":1738886400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,2,7]],"date-time":"2025-02-07T00:00:00Z","timestamp":1738886400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"ERC CoG grant TUgbOAT","award":["772346"],"award-info":[{"award-number":["772346"]}]},{"DOI":"10.13039\/501100004281","name":"Narodowe Centrum Nauki","doi-asserted-by":"publisher","award":["2020\/37\/B\/ST6\/04179"],"award-info":[{"award-number":["2020\/37\/B\/ST6\/04179"]}],"id":[{"id":"10.13039\/501100004281","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2025,3]]},"DOI":"10.1007\/s00224-024-10207-6","type":"journal-article","created":{"date-parts":[[2025,2,7]],"date-time":"2025-02-07T09:41:31Z","timestamp":1738921291000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Online Matching with Delays and Stochastic Arrival Times"],"prefix":"10.1007","volume":"69","author":[{"given":"Mathieu","family":"Mari","sequence":"first","affiliation":[]},{"given":"Micha\u0142","family":"Paw\u0142owski","sequence":"additional","affiliation":[]},{"given":"Runtian","family":"Ren","sequence":"additional","affiliation":[]},{"given":"Piotr","family":"Sankowski","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,2,7]]},"reference":[{"key":"10207_CR1","doi-asserted-by":"publisher","unstructured":"Mari, M., Paw\u0142owski, M., Ren, R., Sankowski, P.: Online matching with delays and stochastic arrival times. In: Proceedings of the International Conference on Autonomous Agents and Multi-agent Systems (AAMAS), pp. 976\u2013984 (2023). https:\/\/doi.org\/10.5555\/3545946.3598737","DOI":"10.5555\/3545946.3598737"},{"key":"10207_CR2","doi-asserted-by":"publisher","unstructured":"Emek, Y., Kutten, S., Wattenhofer, R.: Online matching: haste makes waste! In: Proceedings of ACM Symposium on Theory of Computing (STOC), pp. 333\u2013344 (2016). https:\/\/doi.org\/10.1145\/2897518.2897557","DOI":"10.1145\/2897518.2897557"},{"key":"10207_CR3","doi-asserted-by":"publisher","unstructured":"Azar, Y., Chiplunkar, A., Kaplan, H.: Polylogarithmic bounds on the competitiveness of min-cost perfect matching with delays. In: Proceedings of ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1051\u20131061 (2017). https:\/\/doi.org\/10.1137\/1.9781611974782.67","DOI":"10.1137\/1.9781611974782.67"},{"key":"10207_CR4","doi-asserted-by":"publisher","unstructured":"Ashlagi, I., Azar, Y., Charikar, M., Chiplunkar, A., Geri, O., Kaplan, H., Makhijani, R., Wang, Y., Wattenhofer, R.: Min-cost bipartite perfect matching with delays. In: Proceedings of Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX\/RANDOM), pp. 1\u20131120 (2017). https:\/\/doi.org\/10.4230\/LIPIcs.APPROX-RANDOM.2017.1","DOI":"10.4230\/LIPIcs.APPROX-RANDOM.2017.1"},{"key":"10207_CR5","doi-asserted-by":"publisher","unstructured":"Bienkowski, M., Kraska, A., Schmidt, P.: A match in time saves nine: Deterministic online matching with delays. In: Proceedings of Workshop on Approximation and Online Algorithms (WAOA), pp. 132\u2013146 (2017). https:\/\/doi.org\/10.1007\/978-3-319-89441-6_11","DOI":"10.1007\/978-3-319-89441-6_11"},{"key":"10207_CR6","doi-asserted-by":"publisher","unstructured":"Bienkowski, M., Kraska, A., Liu, H.-H., Schmidt, P.: A primal-dual online deterministic algorithm for matching with delays. In: Proceedings of Workshop on Approximation and Online Algorithms (WAOA), pp. 51\u201368 (2018). https:\/\/doi.org\/10.1007\/978-3-030-04693-4_4","DOI":"10.1007\/978-3-030-04693-4_4"},{"key":"10207_CR7","doi-asserted-by":"publisher","unstructured":"Liu, X., Pan, Z., Wang, Y., Wattenhofer, R.: Impatient online matching. In: Proceedings of the International Symposium on Algorithms and Computation (ISAAC), vol. 123, pp. 62\u201316212 (2018). https:\/\/doi.org\/10.4230\/LIPIcs.ISAAC.2018.62","DOI":"10.4230\/LIPIcs.ISAAC.2018.62"},{"issue":"4","key":"10207_CR8","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1007\/s00224-019-09963-7","volume":"64","author":"Y Azar","year":"2020","unstructured":"Azar, Y., Jacob-Fanani, A.: Deterministic min-cost matching with delays. Theory of Computing Systems. 64(4), 572\u2013592 (2020). https:\/\/doi.org\/10.1007\/s00224-019-09963-7","journal-title":"Theory of Computing Systems."},{"key":"10207_CR9","doi-asserted-by":"publisher","unstructured":"Azar, Y., Ren, R., Vainstein, D.: The min-cost matching with concave delays problem. In: Proceedings of ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 301\u2013320 (2021). https:\/\/doi.org\/10.5555\/3458064.3458084","DOI":"10.5555\/3458064.3458084"},{"key":"10207_CR10","doi-asserted-by":"publisher","unstructured":"Emek, Y., Shapiro, Y., Wang, Y.: Minimum cost perfect matching with delays for two sources. Theoretical Computer Science. 754, 122\u2013129 (2019). https:\/\/doi.org\/10.1016\/j.tcs.2018.07.004","DOI":"10.1016\/j.tcs.2018.07.004"},{"key":"10207_CR11","doi-asserted-by":"publisher","unstructured":"Deryckere, L., Umboh, S.W.: Online matching with set and concave delays. In: Proceedings of Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX\/RANDOM), pp. 17\u201311717 (2023). https:\/\/doi.org\/10.4230\/LIPIcs.APPROX\/RANDOM.2023.17","DOI":"10.4230\/LIPIcs.APPROX\/RANDOM.2023.17"},{"key":"10207_CR12","doi-asserted-by":"publisher","unstructured":"Raghvendra, S.: A robust and optimal online algorithm for minimum metric bipartite matching. In: Proceedings of Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX\/RANDOM), pp. 18\u201311816 (2016). https:\/\/doi.org\/10.4230\/LIPIcs.APPROX-RANDOM.2016.18","DOI":"10.4230\/LIPIcs.APPROX-RANDOM.2016.18"},{"key":"10207_CR13","doi-asserted-by":"publisher","unstructured":"Nayyar, K., Raghvendra, S.: An input sensitive online algorithm for the metric bipartite matching problem. In: Proceedings of IEEE Symposium on Foundations of Computer Science (FOCS), pp. 505\u2013515 (2017). https:\/\/doi.org\/10.1109\/FOCS.2017.53","DOI":"10.1109\/FOCS.2017.53"},{"key":"10207_CR14","doi-asserted-by":"crossref","unstructured":"Kuo, T.-W.: Online deterministic minimum cost bipartite matching with delays on a line. arXiv preprint arXiv:2408.02526. (2024)","DOI":"10.1007\/978-3-031-81396-2_9"},{"key":"10207_CR15","doi-asserted-by":"publisher","unstructured":"Azar, Y., Ganesh, A., Ge, R., Panigrahi, D.: Online service with delay. In: Proceedings of ACM Symposium on Theory of Computing (STOC), pp. 551\u2013563 (2017). https:\/\/doi.org\/10.1145\/3055399.3055475","DOI":"10.1145\/3055399.3055475"},{"key":"10207_CR16","doi-asserted-by":"publisher","unstructured":"Bienkowski, M., Kraska, A., Schmidt, P.: Online service with delay on a line. In: Proceedings of International Colloquium On Structural Information and Communication Complexity (SIROCCO), pp. 237\u2013248 (2018). https:\/\/doi.org\/10.1007\/978-3-030-01325-7_22","DOI":"10.1007\/978-3-030-01325-7_22"},{"key":"10207_CR17","doi-asserted-by":"publisher","unstructured":"Azar, Y., Touitou, N.: General framework for metric optimization problems with delay or with deadlines. In: Proceedings of IEEE Symposium on Foundations of Computer Science (FOCS), pp. 60\u201371 (2019). https:\/\/doi.org\/10.1109\/FOCS.2019.00013","DOI":"10.1109\/FOCS.2019.00013"},{"key":"10207_CR18","doi-asserted-by":"publisher","unstructured":"Touitou, N.: Improved and deterministic online service with deadlines or delay. In: Proceedings of ACM Symposium on Theory of Computing (STOC), pp. 761\u2013774 (2023). https:\/\/doi.org\/10.1145\/3564246.3585107","DOI":"10.1145\/3564246.3585107"},{"key":"10207_CR19","doi-asserted-by":"publisher","unstructured":"Bienkowski, M., B\u00f6hm, M., Byrka, J., Chrobak, M., D\u00fcrr, C., Folwarczn\u1ef3, L., Je\u017c, \u0141., Sgall, J., Nguyen, K.T., Vesel\u1ef3, P.: Online algorithms for multi-level aggregation. In: Proceedings of the European Symposium on Algorithms (ESA), pp. 12\u201311217 (2016). https:\/\/doi.org\/10.4230\/LIPIcs.ESA.2016.12","DOI":"10.4230\/LIPIcs.ESA.2016.12"},{"key":"10207_CR20","doi-asserted-by":"publisher","unstructured":"Buchbinder, N., Feldman, M., Naor, J., Talmon, O.: O(depth)-competitive algorithm for online multi-level aggregation. In: Proceedings of ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1235\u20131244 (2017). https:\/\/doi.org\/10.1137\/1.9781611974782.80","DOI":"10.1137\/1.9781611974782.80"},{"key":"10207_CR21","doi-asserted-by":"publisher","unstructured":"Carrasco, R.A., Pruhs, K., Stein, C., Verschae, J.: The online set aggregation problem. In: Proceedings of Latin American Theoretical Informatics Symposium (LATIN), pp. 245\u2013259 (2018). https:\/\/doi.org\/10.1007\/978-3-319-77404-6_19","DOI":"10.1007\/978-3-319-77404-6_19"},{"key":"10207_CR22","doi-asserted-by":"publisher","unstructured":"Bienkowski, M., B\u00f6hm, M., Byrka, J., Chrobak, M., D\u00fcrr, C., Folwarczn\u1ef3, L., Je\u017c, \u0141., Sgall, J., Thang, N.K., Vesel\u1ef3, P.: New results on multi-level aggregation. Theoretical Computer Science. 861, 133\u2013143 (2021). https:\/\/doi.org\/10.1016\/j.tcs.2021.02.016","DOI":"10.1016\/j.tcs.2021.02.016"},{"key":"10207_CR23","doi-asserted-by":"publisher","unstructured":"Le, N.M., William\u00a0Umboh, S., Xie, N.: The power of clairvoyance for multi-level aggregation and set cover with delay. In: Proceedings of ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1594\u20131610 (2023). https:\/\/doi.org\/10.1137\/1.9781611977554.ch59","DOI":"10.1137\/1.9781611977554.ch59"},{"key":"10207_CR24","doi-asserted-by":"publisher","unstructured":"Mari, M., Paw\u0142owski, M., Ren, R., Sankowski, P.: Online multi-level aggregation with delays and stochastic arrivals. In: Proceedings of the International Symposium on Algorithms and Computation (ISAAC), pp. 49\u201314920 (2024). https:\/\/doi.org\/10.4230\/LIPIcs.ISAAC.2024.49","DOI":"10.4230\/LIPIcs.ISAAC.2024.49"},{"key":"10207_CR25","doi-asserted-by":"publisher","unstructured":"Bienkowski, M., B\u00f6hm, M., Byrka, J., Marcinkowski, J.: Online facility location with linear delay. In: Proceedings of Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX\/RANDOM), pp. 45\u201314517 (2022). https:\/\/doi.org\/10.4230\/LIPIcs.APPROX\/RANDOM.2022.45","DOI":"10.4230\/LIPIcs.APPROX\/RANDOM.2022.45"},{"key":"10207_CR26","doi-asserted-by":"publisher","unstructured":"Azar, Y., Touitou, N.: Beyond tree embeddings\u2013a deterministic framework for network design with deadlines or delay. In: Proceedings of IEEE Symposium on Foundations of Computer Science (FOCS), pp. 1368\u20131379 (2020). https:\/\/doi.org\/10.1109\/FOCS46700.2020.00129","DOI":"10.1109\/FOCS46700.2020.00129"},{"key":"10207_CR27","doi-asserted-by":"publisher","unstructured":"Azar, Y., Emek, Y., Stee, R., Vainstein, D.: The price of clustering in bin-packing with applications to bin-packing with delays. In: Proceedings of ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 1\u201310 (2019). https:\/\/doi.org\/10.1145\/3323165.3323180","DOI":"10.1145\/3323165.3323180"},{"key":"10207_CR28","doi-asserted-by":"publisher","unstructured":"Epstein, L.: On bin packing with clustering and bin packing with delays. Discrete Optimization. 41, 100647 (2021). https:\/\/doi.org\/10.1016\/j.disopt.2021.100647","DOI":"10.1016\/j.disopt.2021.100647"},{"key":"10207_CR29","doi-asserted-by":"publisher","unstructured":"Azar, Y., Chiplunkar, A., Kutten, S., Touitou, N.: Set cover with delay\u2013clairvoyance is not required. In: Proceedings of the European Symposium on Algorithms (ESA), pp. 8\u20131821 (2020). https:\/\/doi.org\/10.4230\/LIPIcs.ESA.2020.8","DOI":"10.4230\/LIPIcs.ESA.2020.8"},{"key":"10207_CR30","doi-asserted-by":"publisher","unstructured":"Touitou, N.: Nearly-tight lower bounds for set cover and network design with deadlines\/delay. In: Proceedings of the International Symposium on Algorithms and Computation (ISAAC), pp. 53\u201315316 (2021). https:\/\/doi.org\/10.4230\/LIPIcs.ISAAC.2021.53","DOI":"10.4230\/LIPIcs.ISAAC.2021.53"},{"key":"10207_CR31","unstructured":"Melnyk, D., Wang, Y., Wattenhofer, R.: Online k-way matching with delays and the h-metric. arXiv preprint arXiv:2109.06640. (2021)"},{"key":"10207_CR32","doi-asserted-by":"publisher","unstructured":"Gupta, A., Kumar, A., Panigrahi, D.: Caching with time windows. In: Proceedings of ACM Symposium on Theory of Computing (STOC), pp. 1125\u20131138 (2020). https:\/\/doi.org\/10.1137\/20M1346286","DOI":"10.1137\/20M1346286"},{"key":"10207_CR33","doi-asserted-by":"publisher","unstructured":"Chen, R., Khatkar, J., Umboh, S.W.: Online weighted cardinality joint replenishment problem with delay. In: Proceedings of the International Colloquium on Automata, Languages, and Programming (ICALP), pp. 40\u201314018 (2022). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2022.40","DOI":"10.4230\/LIPIcs.ICALP.2022.40"},{"key":"10207_CR34","doi-asserted-by":"publisher","unstructured":"Kakimura, N., Nakayoshi, T.: Deterministic primal-dual algorithms for online k-way matching with delays. In: Proceedings of the International Computing and Combinatorics Conference (COCOON), pp. 238\u2013249 (2023). https:\/\/doi.org\/10.1007\/978-3-031-49193-1_18","DOI":"10.1007\/978-3-031-49193-1_18"},{"key":"10207_CR35","unstructured":"Kawase, Y., Nakayoshi, T.: Online matching with delays and size-based costs. arXiv preprint arXiv:2408.08658. (2024)"},{"key":"10207_CR36","doi-asserted-by":"publisher","unstructured":"Collina, N., Immorlica, N., Leyton-Brown, K., Lucier, B., Newman, N.: Dynamic weighted matching with heterogeneous arrival and departure rates. In: Proceedings of the Conference on Web and Internet Economics (WINE), pp. 17\u201330 (2020). https:\/\/doi.org\/10.1007\/978-3-030-64946-3_2","DOI":"10.1007\/978-3-030-64946-3_2"},{"key":"10207_CR37","doi-asserted-by":"publisher","unstructured":"Aouad, A., Sarita\u00e7, \u00d6.: Dynamic stochastic matching under limited time. In: Proceedings of ACM Conference on Economics and Computation (EC), pp. 789\u2013790 (2020). https:\/\/doi.org\/10.1145\/3391403.3399524","DOI":"10.1145\/3391403.3399524"},{"key":"10207_CR38","unstructured":"Kakimura, N., Zhu, D.: Dynamic bipartite matching market with arrivals and departures. arXiv preprint arXiv:2110.10824. (2021)"},{"key":"10207_CR39","doi-asserted-by":"publisher","unstructured":"Kessel, K., Shameli, A., Saberi, A., Wajc, D.: The stationary prophet inequality problem. In: Proceedings of ACM Conference on Economics and Computation (EC), pp. 243\u2013244 (2022). https:\/\/doi.org\/10.1145\/3490486.3538374","DOI":"10.1145\/3490486.3538374"},{"key":"10207_CR40","doi-asserted-by":"publisher","unstructured":"B\u00e4umler, J., Bullinger, M., Kober, S., Zhu, D.: Superiority of instantaneous decisions in thin dynamic matching markets. In: Proceedings of ACM Conference on Economics and Computation (EC), pp. 390\u2013390 (2023). https:\/\/doi.org\/10.1145\/3580507.3597660","DOI":"10.1145\/3580507.3597660"},{"issue":"125\u2013130","key":"10207_CR41","doi-asserted-by":"publisher","first-page":"55","DOI":"10.6028\/JRES.069B.013","volume":"69","author":"J Edmonds","year":"1965","unstructured":"Edmonds, J.: Maximum matching and a polyhedron with 0, 1-vertices. Journal of research of the National Bureau of Standards B. 69(125\u2013130), 55\u201356 (1965). https:\/\/doi.org\/10.6028\/JRES.069B.013","journal-title":"Journal of research of the National Bureau of Standards B."},{"key":"10207_CR42","doi-asserted-by":"publisher","unstructured":"Edmonds, J.: Paths, trees, and flowers. Canadian Journal of mathematics. 17, 449\u2013467 (1965). https:\/\/doi.org\/10.1007\/978-0-8176-4842-8_26","DOI":"10.1007\/978-0-8176-4842-8_26"},{"key":"10207_CR43","doi-asserted-by":"publisher","unstructured":"Farhadi, A., Gilbert, J., Hajiaghayi, M.: Generalized stochastic matching. In: Proceedings of the Conference on Artificial Intelligence (AAAI), pp. 10008\u201310015 (2022). https:\/\/doi.org\/10.1609\/aaai.v36i9.21239","DOI":"10.1609\/aaai.v36i9.21239"},{"key":"10207_CR44","doi-asserted-by":"publisher","unstructured":"Goyal, M.: Secretary matching with vertex arrivals and no rejections. In: Proceedings of the Conference on Artificial Intelligence (AAAI), vol. 36, pp. 5051\u20135058 (2022). https:\/\/doi.org\/10.1609\/aaai.v36i5.20437","DOI":"10.1609\/aaai.v36i5.20437"},{"key":"10207_CR45","doi-asserted-by":"publisher","unstructured":"Boehmer, N., Brill, M., Schmidt-Kraepelin, U.: Proportional representation in matching markets: Selecting multiple matchings under dichotomous preferences. In: Proceedings of the International Conference on Autonomous Agents and Multi-agent Systems (AAMAS), pp. 136\u2013144 (2022). https:\/\/doi.org\/10.5555\/3535850.3535867","DOI":"10.5555\/3535850.3535867"},{"key":"10207_CR46","doi-asserted-by":"publisher","unstructured":"Cho, S.-H., Todo, T., Yokoo, M.: Two-sided matching over social networks. In: Proceedings of the International Joint Conferences on Artificial Intelligence (IJCAI), pp. 186\u2013193 (2022). https:\/\/doi.org\/10.24963\/ijcai.2022\/27","DOI":"10.24963\/ijcai.2022\/27"},{"key":"10207_CR47","doi-asserted-by":"publisher","unstructured":"Brilliantova, A., Hosseini, H.: Fair stable matching meets correlated preferences. In: Proceedings of the International Conference on Autonomous Agents and Multi-agent Systems (AAMAS), pp. 190\u2013198 (2022). https:\/\/doi.org\/10.5555\/3535850.3535873","DOI":"10.5555\/3535850.3535873"},{"key":"10207_CR48","doi-asserted-by":"publisher","unstructured":"Ma, W., Xu, P., Xu, Y.: Group-level fairness maximization in online bipartite matching. In: Proceedings of the International Conference on Autonomous Agents and Multi-agent Systems (AAMAS), pp. 1687\u20131689 (2022). https:\/\/doi.org\/10.5555\/3535850.3536077","DOI":"10.5555\/3535850.3536077"},{"key":"10207_CR49","doi-asserted-by":"publisher","unstructured":"Kamiyama, N.: On stable matchings with pairwise preferences and matroid constraints. In: Proceedings of the International Conference on Autonomous Agents and Multi-agent Systems (AAMAS), pp. 584\u2013592 (2020). https:\/\/doi.org\/10.5555\/3398761.3398832","DOI":"10.5555\/3398761.3398832"},{"key":"10207_CR50","doi-asserted-by":"publisher","unstructured":"Kawase, Y.: Approximately stable matchings with general constraints. In: Proceedings of the International Conference on Autonomous Agents and Multi-agent Systems (AAMAS), pp. 602\u2013610 (2020). https:\/\/doi.org\/10.5555\/3398761.3398834","DOI":"10.5555\/3398761.3398834"},{"key":"10207_CR51","doi-asserted-by":"publisher","unstructured":"Zhou, Y.-H., Liang, C., Li, N., Yang, C., Zhu, S., Jin, R.: Robust online matching with user arrival distribution drift. In: Proceedings of the Conference on Artificial Intelligence (AAAI), vol. 33, pp. 459\u2013466 (2019). https:\/\/doi.org\/10.1609\/aaai.v33i01.3301459","DOI":"10.1609\/aaai.v33i01.3301459"},{"key":"10207_CR52","doi-asserted-by":"publisher","unstructured":"Bir\u00f3, P., Kern, W., P\u00e1lv\u00f6lgyi, D., Paulusma, D.: Generalized matching games for international kidney exchange. In: Proceedings of the International Conference on Autonomous Agents and Multi-agent Systems (AAMAS), pp. 413\u2013421 (2019). https:\/\/doi.org\/10.5555\/3306127.3331721","DOI":"10.5555\/3306127.3331721"},{"key":"10207_CR53","doi-asserted-by":"publisher","unstructured":"Aziz, H., Bir\u00f3, P., Fleiner, T., Gaspers, S., Haan, R., Mattei, N., Rastegari, B.: Stable matching with uncertain pairwise preferences. In: Proceedings of the International Conference on Autonomous Agents and Multi-agent Systems (AAMAS), pp. 344\u2013352 (2017). https:\/\/doi.org\/10.5555\/3091125.3091179","DOI":"10.5555\/3091125.3091179"},{"key":"10207_CR54","doi-asserted-by":"publisher","unstructured":"Brubach, B., Sankararaman, K.A., Srinivasan, A., Xu, P.: Attenuate locally, win globally: An attenuation-based framework for online stochastic matching with timeouts. In: Proceedings of the International Conference on Autonomous Agents and Multi-agent Systems (AAMAS), pp. 1223\u20131231 (2017). https:\/\/doi.org\/10.5555\/3091125.3091295","DOI":"10.5555\/3091125.3091295"},{"key":"10207_CR55","doi-asserted-by":"publisher","unstructured":"Pini, M.S., Rossi, F., Venable, K.B.: Stable matching problems with soft constraints. In: Proceedings of the International Conference on Autonomous Agents and Multi-agent Systems (AAMAS), pp. 1511\u20131512 (2014). https:\/\/doi.org\/10.5555\/2615731.2616037","DOI":"10.5555\/2615731.2616037"},{"key":"10207_CR56","doi-asserted-by":"publisher","unstructured":"Garg, N., Gupta, A., Leonardi, S., Sankowski, P.: Stochastic analyses for online combinatorial optimization problems. In: Proceedings of ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 942\u2013951 (2008). https:\/\/doi.org\/10.5555\/1347082.1347185","DOI":"10.5555\/1347082.1347185"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-024-10207-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00224-024-10207-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-024-10207-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,8]],"date-time":"2025-04-08T17:16:53Z","timestamp":1744132613000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00224-024-10207-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,7]]},"references-count":56,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,3]]}},"alternative-id":["10207"],"URL":"https:\/\/doi.org\/10.1007\/s00224-024-10207-6","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"type":"print","value":"1432-4350"},{"type":"electronic","value":"1433-0490"}],"subject":[],"published":{"date-parts":[[2025,2,7]]},"assertion":[{"value":"5 November 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 February 2025","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"12"}}