{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T16:39:04Z","timestamp":1742920744332,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031710322"},{"type":"electronic","value":"9783031710339"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-71033-9_2","type":"book-chapter","created":{"date-parts":[[2024,9,3]],"date-time":"2024-09-03T00:02:17Z","timestamp":1725321737000},"page":"21-34","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Online Matching with\u00a0High Probability"],"prefix":"10.1007","author":[{"given":"Milena","family":"Mihail","sequence":"first","affiliation":[]},{"given":"Thorben","family":"Tr\u00f6bst","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,8,31]]},"reference":[{"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)","key":"2_CR1","DOI":"10.1137\/1.9781611973082.95"},{"issue":"1","key":"2_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). https:\/\/doi.org\/10.1145\/1360443.1360462","journal-title":"SIGACT News"},{"doi-asserted-by":"crossref","unstructured":"Cohen, I.R., Wajc, D.: Randomized online matching in regular graphs. In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 960\u2013979. SIAM (2018)","key":"2_CR3","DOI":"10.1137\/1.9781611975031.62"},{"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)","key":"2_CR4","DOI":"10.1137\/1.9781611973105.7"},{"key":"2_CR5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511581274","volume-title":"Concentration of Measure for the Analysis of Randomized Algorithms","author":"DP Dubhashi","year":"2009","unstructured":"Dubhashi, D.P., Panconesi, A.: Concentration of Measure for the Analysis of Randomized Algorithms. Cambridge University Press, Cambridge (2009). https:\/\/doi.org\/10.1017\/CBO9780511581274"},{"key":"2_CR6","doi-asserted-by":"publisher","DOI":"10.1017\/9781108937535","volume-title":"Online and Matching-Based Market Design","author":"F Echenique","year":"2023","unstructured":"Echenique, F., Immorlica, N., Vazirani, V.: Online and Matching-Based Market Design. Cambridge University Press, Cambridge (2023)"},{"doi-asserted-by":"publisher","unstructured":"Eden, A., Feldman, M., Fiat, A., Segal, K.: An economics-based analysis of RANKING for online bipartite matching. In: Le, H.V., King, V. (eds.) 4th Symposium on Simplicity in Algorithms, SOSA 2021, pp. 107\u2013110. SIAM (2021). https:\/\/doi.org\/10.1137\/1.9781611976496.12","key":"2_CR7","DOI":"10.1137\/1.9781611976496.12"},{"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":"2_CR8"},{"doi-asserted-by":"publisher","unstructured":"Huang, Z., Zhang, Q., Zhang, Y.: Adwords in a panorama. In: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), Los Alamitos, CA, USA, pp. 1416\u20131426. IEEE Computer Society (2020). https:\/\/doi.org\/10.1109\/FOCS46700.2020.00133","key":"2_CR9","DOI":"10.1109\/FOCS46700.2020.00133"},{"doi-asserted-by":"crossref","unstructured":"Huang, Z., Kang, N., Tang, Z.G., Wu, X., Zhang, Y., Zhu, X.: How to match when all vertices arrive online. In: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, pp. 17\u201329 (2018)","key":"2_CR10","DOI":"10.1145\/3188745.3188858"},{"doi-asserted-by":"crossref","unstructured":"Huang, Z., Peng, B., Tang, Z.G., Tao, R., Wu, X., Zhang, Y.: Tight competitive ratios of classic matching algorithms in the fully online model. In: Proceedings of the 30th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 2875\u20132886. SIAM (2019)","key":"2_CR11","DOI":"10.1137\/1.9781611975482.178"},{"doi-asserted-by":"crossref","unstructured":"Huang, Z., Tang, Z.G., Wu, X., Zhang, Y.: Fully online matching ii: beating ranking and water-filling. In: Proceedings of the 51st Annual IEEE Symposium on Foundations of Computer Science. IEEE (2020)","key":"2_CR12","DOI":"10.1109\/FOCS46700.2020.00130"},{"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)","key":"2_CR13","DOI":"10.1145\/100216.100262"},{"doi-asserted-by":"publisher","unstructured":"Komm, D., Kr\u00e1lovic, R., Kr\u00e1lovic, R., M\u00f6mke, T.: Randomized online algorithms with high probability guarantees. In: Mayr, E.W., Portier, N. (eds.) 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a025, pp. 470\u2013481. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik, Dagstuhl (2014). https:\/\/doi.org\/10.4230\/LIPIcs.STACS.2014.470","key":"2_CR14","DOI":"10.4230\/LIPIcs.STACS.2014.470"},{"issue":"1","key":"2_CR15","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1137\/S0097539798346706","volume":"31","author":"S Leonardi","year":"2001","unstructured":"Leonardi, S., Marchetti-Spaccamela, A., Presciutti, A., Ros\u00e9n, A.: On-line randomized call control revisited. SIAM J. Comput. 31(1), 86\u2013112 (2001). https:\/\/doi.org\/10.1137\/S0097539798346706","journal-title":"SIAM J. Comput."},{"key":"2_CR16","series-title":"London Mathematical Society Lecture Note Series","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1017\/CBO9781107359949.008","volume-title":"On the Method of Bounded Differences","author":"C McDiarmid","year":"1989","unstructured":"McDiarmid, C.: On the Method of Bounded Differences. London Mathematical Society Lecture Note Series, pp. 148\u2013188. Cambridge University Press, Cambridge (1989). https:\/\/doi.org\/10.1017\/CBO9781107359949.008"},{"doi-asserted-by":"crossref","unstructured":"Mehta, A., Saberi, A., Vazirani, U., Vazirani, V.: Adwords and generalized online matching. J. ACM (JACM) 54(5), 22-es (2007)","key":"2_CR17","DOI":"10.1145\/1284320.1284321"},{"unstructured":"Sedgewick, R.: Quicksort. Ph.D. thesis, Stanford University (1975)","key":"2_CR18"},{"doi-asserted-by":"publisher","unstructured":"Vazirani, V.V.: Towards a practical, budget-oblivious algorithm for the adwords problem under small bids. In: Bouyer, P., Srinivasan, S. (eds.) 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2023). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a0284, pp. 21:1\u201321:14. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl (2023). https:\/\/doi.org\/10.4230\/LIPIcs.FSTTCS.2023.21","key":"2_CR19","DOI":"10.4230\/LIPIcs.FSTTCS.2023.21"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-71033-9_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,3]],"date-time":"2024-09-03T00:02:28Z","timestamp":1725321748000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-71033-9_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031710322","9783031710339"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-71033-9_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"31 August 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAGT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Algorithmic Game Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Amsterdam","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","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":"3 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sagt2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cwi.nl\/en\/groups\/networks-and-optimization\/events\/sagt-2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}