{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T02:36:04Z","timestamp":1742956564554,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030046927"},{"type":"electronic","value":"9783030046934"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-04693-4_10","type":"book-chapter","created":{"date-parts":[[2018,11,28]],"date-time":"2018-11-28T05:03:12Z","timestamp":1543381392000},"page":"149-164","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["DISPATCH: An Optimally-Competitive Algorithm for Maximum Online Perfect Bipartite Matching with i.i.d.\u00a0Arrivals"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2251-4163","authenticated-orcid":false,"given":"Minjun","family":"Chang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2498-0512","authenticated-orcid":false,"given":"Dorit S.","family":"Hochbaum","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2788-1904","authenticated-orcid":false,"given":"Quico","family":"Spaen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1176-5159","authenticated-orcid":false,"given":"Mark","family":"Velednitsky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,11,29]]},"reference":[{"key":"10_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"522","DOI":"10.1007\/978-3-540-75520-3_47","volume-title":"Algorithms \u2013 ESA 2007","author":"N Bansal","year":"2007","unstructured":"Bansal, N., Buchbinder, N., Gupta, A., Naor, J.S.: An O(log2k)-competitive algorithm for metric bipartite matching. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol. 4698, pp. 522\u2013533. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-75520-3_47"},{"key":"10_CR2","doi-asserted-by":"publisher","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, vol. 57, pp. 24:1\u201324:16. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2016). https:\/\/doi.org\/10.4230\/LIPIcs.ESA.2016.24","DOI":"10.4230\/LIPIcs.ESA.2016.24"},{"key":"10_CR3","doi-asserted-by":"publisher","unstructured":"Bubeck, S., Cohen, M.B., Lee, Y.T., Lee, J.R., Madry, A.: K-server via multiscale entropic regularization. In: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, pp. 3\u201316. ACM (2018). https:\/\/doi.org\/10.1145\/3188745.3188798","DOI":"10.1145\/3188745.3188798"},{"key":"10_CR4","doi-asserted-by":"publisher","unstructured":"Correa, J., Foncea, P., Hoeksma, R., Oosterwijk, T., Vredeveld, T.: Posted price mechanisms for a random stream of customers. In: Proceedings of the 2017 ACM Conference on Economics and Computation, pp. 169\u2013186. ACM (2017). https:\/\/doi.org\/10.1145\/3033274.3085137","DOI":"10.1145\/3033274.3085137"},{"key":"10_CR5","unstructured":"Dehghani, S., Ehsani, S., Hajiaghayi, M., Liaghat, V., Seddighin, S.: Stochastic k-server: how should uber work? In: 44th International Colloquium on Automata, Languages, and Programming, vol. 80, pp. 126:1\u2013126:14. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2017)"},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/978-3-642-10841-9_34","volume-title":"Internet and Network Economics","author":"J Feldman","year":"2009","unstructured":"Feldman, J., Korula, N., Mirrokni, V., Muthukrishnan, S., P\u00e1l, M.: Online ad assignment with free disposal. In: Leonardi, S. (ed.) WINE 2009. LNCS, vol. 5929, pp. 374\u2013385. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10841-9_34"},{"key":"10_CR7","doi-asserted-by":"publisher","unstructured":"Feldman, J., Mehta, A., Mirrokni, V., Muthukrishnan, S.: Online stochastic matching: Beating 1\u20131\/e. In: 50th Annual IEEE Symposium on Foundations of Computer Science, pp. 117\u2013126. IEEE (2009). https:\/\/doi.org\/10.1109\/FOCS.2009.72","DOI":"10.1109\/FOCS.2009.72"},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/978-3-642-25510-6_15","volume-title":"Internet and Network Economics","author":"B Haeupler","year":"2011","unstructured":"Haeupler, B., Mirrokni, V.S., Zadimoghaddam, M.: Online stochastic weighted matching: improved approximation algorithms. In: Chen, N., Elkind, E., Koutsoupias, E. (eds.) WINE 2011. LNCS, vol. 7090, pp. 170\u2013181. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25510-6_15"},{"issue":"3","key":"10_CR9","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1006\/jagm.1993.1026","volume":"14","author":"B Kalyanasundaram","year":"1993","unstructured":"Kalyanasundaram, B., Pruhs, K.: Online weighted matching. J. Algorithms 14(3), 478\u2013488 (1993). https:\/\/doi.org\/10.1006\/jagm.1993.1026","journal-title":"J. Algorithms"},{"key":"10_CR10","doi-asserted-by":"publisher","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. ACM (1990). https:\/\/doi.org\/10.1145\/100216.100262","DOI":"10.1145\/100216.100262"},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1007\/978-3-642-40450-4_50","volume-title":"Algorithms \u2013 ESA 2013","author":"T Kesselheim","year":"2013","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: Bodlaender, H.L., Italiano, G.F. (eds.) ESA 2013. LNCS, vol. 8125, pp. 589\u2013600. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40450-4_50"},{"issue":"2","key":"10_CR12","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/0304-3975(94)90042-6","volume":"127","author":"S Khuller","year":"1994","unstructured":"Khuller, S., Mitchell, S.G., Vazirani, V.V.: On-line algorithms for weighted bipartite matching and stable marriages. Theor. Comput. Sci. 127(2), 255\u2013267 (1994). https:\/\/doi.org\/10.1016\/0304-3975(94)90042-6","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"10_CR13","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/j.cosrev.2009.04.002","volume":"3","author":"E Koutsoupias","year":"2009","unstructured":"Koutsoupias, E.: The k-server problem. Compu. Sci. Rev. 3(2), 105\u2013118 (2009). https:\/\/doi.org\/10.1016\/j.cosrev.2009.04.002","journal-title":"Compu. Sci. Rev."},{"key":"10_CR14","doi-asserted-by":"publisher","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. ACM (2011). https:\/\/doi.org\/10.1145\/1993636.1993716","DOI":"10.1145\/1993636.1993716"},{"issue":"2","key":"10_CR15","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1016\/0196-6774(90)90003-W","volume":"11","author":"MS Manasse","year":"1990","unstructured":"Manasse, M.S., McGeoch, L.A., Sleator, D.D.: Competitive algorithms for server problems. J. Algorithms 11(2), 208\u2013230 (1990). https:\/\/doi.org\/10.1016\/0196-6774(90)90003-W","journal-title":"J. Algorithms"},{"issue":"4","key":"10_CR16","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). https:\/\/doi.org\/10.1287\/moor.1120.0551","journal-title":"Math. Oper. Res."},{"issue":"4","key":"10_CR17","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1561\/0400000057","volume":"8","author":"A Mehta","year":"2013","unstructured":"Mehta, A., et al.: 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":"10_CR18","doi-asserted-by":"crossref","unstructured":"Meyerson, A., Nanavati, A., Poplawski, L.: Randomized online algorithms for minimum metric bipartite matching. In: Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 954\u2013959. Society for Industrial and Applied Mathematics (2006)","DOI":"10.1145\/1109557.1109662"},{"key":"10_CR19","doi-asserted-by":"publisher","unstructured":"Raghvendra, S.: A robust and optimal online algorithm for minimum metric bipartite matching. In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, vol. 60, pp. 18:1\u201318:16. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2016). https:\/\/doi.org\/10.4230\/LIPIcs.APPROX-RANDOM.2016.18","DOI":"10.4230\/LIPIcs.APPROX-RANDOM.2016.18"}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-04693-4_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T13:23:30Z","timestamp":1710249810000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-04693-4_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030046927","9783030046934"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-04693-4_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"29 November 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WAOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Approximation and Online Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Helsinki","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Finland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 August 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 August 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"waoa2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/algo2018.hiit.fi\/waoa\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}