{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T14:21:57Z","timestamp":1778595717416,"version":"3.51.4"},"publisher-location":"Cham","reference-count":44,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319894409","type":"print"},{"value":"9783319894416","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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-319-89441-6_11","type":"book-chapter","created":{"date-parts":[[2018,3,30]],"date-time":"2018-03-30T09:43:23Z","timestamp":1522403003000},"page":"132-146","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["A Match in Time Saves Nine: Deterministic Online Matching with Delays"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2453-7772","authenticated-orcid":false,"given":"Marcin","family":"Bienkowski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Artur","family":"Kraska","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pawe\u0142","family":"Schmidt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,3,31]]},"reference":[{"issue":"4","key":"11_CR1","doi-asserted-by":"publisher","first-page":"938","DOI":"10.1137\/S0895480104441656","volume":"19","author":"S Albers","year":"2005","unstructured":"Albers, S., Bals, H.: Dynamic TCP acknowledgment: penalizing long delays. SIAM J. Discret. Math. 19(4), 938\u2013951 (2005)","journal-title":"SIAM J. Discret. Math."},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/978-3-319-18263-6_2","volume-title":"Approximation and Online Algorithms","author":"A Antoniadis","year":"2015","unstructured":"Antoniadis, A., Barcelo, N., Nugent, M., Pruhs, K., Scquizzato, M.: A $$o(n)$$-competitive deterministic algorithm for online matching on a line. In: Bampis, E., Svensson, O. (eds.) WAOA 2014. LNCS, vol. 8952, pp. 11\u201322. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-18263-6_2"},{"key":"11_CR3","unstructured":"Ashlagi, I., Azar, Y., Charikar, M., Chiplunkar, A., Geri, O., Kaplan, H., Makhijani, R.M., Wang, Y., Wattenhofer, R.: Min-cost bipartite perfect matching with delays. In: Proceedings of the 20th International Workshop on Approximation Algorithms for Combinatorial Optimization (APPROX), pp. 1:1\u20131:20 (2017)"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Avontuur, T., Spronck, P., van Zaanen, M.: Player skill modeling in Starcraft II. In: Proceedings of the 9th AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment, AIIDE-2013 (2013)","DOI":"10.1609\/aiide.v9i1.12682"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Azar, Y., Chiplunkar, A., Kaplan, H.: Polylogarithmic bounds on the competitiveness of min-cost (bipartite) perfect matching with delays (2016). https:\/\/arxiv.org\/abs\/1610.05155","DOI":"10.1137\/1.9781611974782.67"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Azar, Y., Chiplunkar, A., Kaplan, H.: Polylogarithmic bounds on the competitiveness of min-cost perfect matching with delays. In: Proceedings of the 28th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1051\u20131061 (2017)","DOI":"10.1137\/1.9781611974782.67"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Azar, Y., Epstein, A., Je\u017c, \u0141., Vardi, A.: Make-to-order integrated scheduling and distribution. In: Proceedings of the 27th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 140\u2013154 (2016)","DOI":"10.1137\/1.9781611974331.ch11"},{"issue":"2","key":"11_CR8","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1007\/s00453-012-9676-9","volume":"68","author":"N Bansal","year":"2014","unstructured":"Bansal, N., Buchbinder, N., Gupta, A., Naor, J.: A randomized $$O(\\log ^2 k)$$-competitive algorithm for metric bipartite matching. Algorithmica 68(2), 390\u2013403 (2014)","journal-title":"Algorithmica"},{"issue":"5","key":"11_CR9","doi-asserted-by":"publisher","first-page":"40:1","DOI":"10.1145\/2783434","volume":"62","author":"N Bansal","year":"2015","unstructured":"Bansal, N., Buchbinder, N., M\u0105dry, A., Naor, J.: A polylogarithmic-competitive algorithm for the k-server problem. J. ACM 62(5), 40:1\u201340:49 (2015)","journal-title":"J. ACM"},{"key":"11_CR10","unstructured":"Bienkowski, M., B\u00f6hm, M., Byrka, J., Chrobak, M., D\u00fcrr, C., Folwarczn\u00fd, L., Je\u017c, \u0141., Sgall, J., Thang, N.K., Vesel\u00fd, P.: Online algorithms for multi-level aggregation. In: Proceedings of the 24th European Symposium on Algorithms (ESA), pp. 12:1\u201312:17 (2016)"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Bienkowski, M., Byrka, J., Chrobak, M., Je\u017c, \u0141., Nogneng, D., Sgall, J.: Better approximation bounds for the joint replenishment problem. In: Proceedings of the 25th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 42\u201354 (2014)","DOI":"10.1137\/1.9781611973402.4"},{"key":"11_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/978-3-642-40104-6_12","volume-title":"Algorithms and Data Structures","author":"M Bienkowski","year":"2013","unstructured":"Bienkowski, M., Byrka, J., Chrobak, M., Je\u017c, \u0141., Sgall, J., Stachowiak, G.: Online control message aggregation in chain networks. In: Dehne, F., Solis-Oba, R., Sack, J.-R. (eds.) WADS 2013. LNCS, vol. 8037, pp. 133\u2013145. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40104-6_12"},{"issue":"1","key":"11_CR13","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)","journal-title":"SIGACT News"},{"key":"11_CR14","volume-title":"Online Computation and Competitive Analysis","author":"A Borodin","year":"1998","unstructured":"Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)"},{"issue":"4","key":"11_CR15","doi-asserted-by":"publisher","first-page":"584","DOI":"10.1007\/s00453-011-9567-5","volume":"64","author":"C Brito","year":"2012","unstructured":"Brito, C., Koutsoupias, E., Vaya, S.: Competitive analysis of organization networks or multicast acknowledgement: how much to wait? Algorithmica 64(4), 584\u2013605 (2012)","journal-title":"Algorithmica"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Buchbinder, N., Feldman, M., Naor, J.S., Talmon, O.: O(depth)-competitive algorithm for online multi-level aggregation. In: Proceedings of the 28th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1235\u20131244 (2017)","DOI":"10.1137\/1.9781611974782.80"},{"key":"11_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/978-3-540-75520-3_24","volume-title":"Algorithms \u2013 ESA 2007","author":"N Buchbinder","year":"2007","unstructured":"Buchbinder, N., Jain, K., Naor, J.S.: Online primal-dual algorithms for maximizing ad-auctions revenue. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol. 4698, pp. 253\u2013264. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-75520-3_24"},{"key":"11_CR18","unstructured":"Buchbinder, N., Kimbrel, T., Levi, R., Makarychev, K., Sviridenko, M.: Online make-to-order joint replenishment model: primal dual competitive algorithms. In: Proceedings of the 19th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 952\u2013961 (2008)"},{"key":"11_CR19","unstructured":"Chen, Z., Sun, Y., El-Nasr, M.S., Nguyen, T.D.: Player skill decomposition in multiplayer online battle arenas (2017). http:\/\/arxiv.org\/abs\/1702.06253"},{"issue":"1","key":"11_CR20","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1145\/2596583.2596603","volume":"45","author":"M Chrobak","year":"2014","unstructured":"Chrobak, M.: Online aggregation problems. SIGACT News 45(1), 91\u2013102 (2014)","journal-title":"SIGACT News"},{"issue":"3","key":"11_CR21","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1109\/TCIAIG.2012.2188833","volume":"4","author":"O Delalleau","year":"2012","unstructured":"Delalleau, O., Contal, E., Thibodeau-Laufer, E., Ferrari, R.C., Bengio, Y., Zhang, F.: Beyond skill rating: advanced matchmaking in Ghost Recon Online. IEEE Trans. Comput. Intel. AI Games 4(3), 167\u2013177 (2012)","journal-title":"IEEE Trans. Comput. Intel. AI Games"},{"key":"11_CR22","doi-asserted-by":"crossref","unstructured":"Devanur, N.R., Jain, K.: Online matching with concave returns. In: Proceedings 44th ACM Symposium on Theory of Computing (STOC), pp. 137\u2013144 (2012)","DOI":"10.1145\/2213977.2213992"},{"key":"11_CR23","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 ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 101\u2013107 (2013)","DOI":"10.1137\/1.9781611973105.7"},{"issue":"2","key":"11_CR24","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1145\/375827.375843","volume":"48","author":"DR Dooly","year":"2001","unstructured":"Dooly, D.R., Goldman, S.A., Scott, S.D.: On-line analysis of the TCP acknowledgment delay problem. J. ACM 48(2), 243\u2013273 (2001)","journal-title":"J. ACM"},{"key":"11_CR25","volume-title":"The Rating of Chessplayers, Past and Present","author":"AE Elo","year":"1978","unstructured":"Elo, A.E.: The Rating of Chessplayers, Past and Present. Arco Publishing, New York (1978)"},{"key":"11_CR26","doi-asserted-by":"crossref","unstructured":"Emek, Y., Kutten, S., Wattenhofer, R.: Online matching: haste makes waste! In: Proceedings of the 48th ACM Symposium on Theory of Computing (STOC), pp. 333\u2013344 (2016)","DOI":"10.1145\/2897518.2897557"},{"key":"11_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/978-3-319-57586-5_18","volume-title":"Algorithms and Complexity","author":"Y Emek","year":"2017","unstructured":"Emek, Y., Shapiro, Y., Wang, Y.: Minimum cost perfect matching with delays for two sources. In: Fotakis, D., Pagourtzis, A., Paschos, V.T. (eds.) CIAC 2017. LNCS, vol. 10236, pp. 209\u2013221. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-57586-5_18"},{"issue":"3","key":"11_CR28","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1016\/j.jcss.2004.04.011","volume":"69","author":"J Fakcharoenphol","year":"2004","unstructured":"Fakcharoenphol, J., Rao, S., Talwar, K.: A tight bound on approximating arbitrary metrics by tree metrics. J. Comput. Syst. Sci. 69(3), 485\u2013497 (2004)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1\u20133","key":"11_CR29","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/j.tcs.2004.10.028","volume":"332","author":"B Fuchs","year":"2005","unstructured":"Fuchs, B., Hochst\u00e4ttler, W., Kern, W.: Online matching on a line. Theor. Comput. Sci. 332(1\u20133), 251\u2013264 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"11_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1007\/978-3-642-31594-7_36","volume-title":"Automata, Languages, and Programming","author":"A Gupta","year":"2012","unstructured":"Gupta, A., Lewi, K.: The online metric matching problem for doubling metrics. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012, Part I. LNCS, vol. 7391, pp. 424\u2013435. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31594-7_36"},{"issue":"3","key":"11_CR31","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)","journal-title":"J. Algorithms"},{"issue":"3","key":"11_CR32","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/s00453-003-1013-x","volume":"36","author":"AR Karlin","year":"2003","unstructured":"Karlin, A.R., Kenyon, C., Randall, D.: Dynamic TCP acknowledgement and other stories about e\/(e\u00a0$$-$$\u00a01). Algorithmica 36(3), 209\u2013224 (2003)","journal-title":"Algorithmica"},{"issue":"6","key":"11_CR33","doi-asserted-by":"publisher","first-page":"542","DOI":"10.1007\/BF01189993","volume":"11","author":"AR Karlin","year":"1994","unstructured":"Karlin, A.R., Manasse, M.S., McGeoch, L.A., Owicki, S.: Competitive randomized algorithms for non-uniform problems. Algorithmica 11(6), 542\u2013571 (1994)","journal-title":"Algorithmica"},{"key":"11_CR34","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 ACM Symposium on Theory of Computing (STOC), pp. 352\u2013358 (1990)","DOI":"10.1145\/100216.100262"},{"key":"11_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/3-540-45465-9_13","volume-title":"Automata, Languages and Programming","author":"S Khanna","year":"2002","unstructured":"Khanna, S., Naor, J.S., Raz, D.: Control message aggregation in group communication protocols. In: Widmayer, P., Eidenbenz, S., Triguero, F., Morales, R., Conejo, R., Hennessy, M. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 135\u2013146. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45465-9_13"},{"issue":"2","key":"11_CR36","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)","journal-title":"Theor. Comput. Sci."},{"key":"11_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/978-3-540-24592-6_14","volume-title":"Approximation and Online Algorithms","author":"E Koutsoupias","year":"2004","unstructured":"Koutsoupias, E., Nanavati, A.: The online matching problem on a line. In: Solis-Oba, R., Jansen, K. (eds.) WAOA 2003. LNCS, vol. 2909, pp. 179\u2013191. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24592-6_14"},{"key":"11_CR38","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 ACM Symposium on Theory of Computing (STOC), pp. 597\u2013606 (2011)","DOI":"10.1145\/1993636.1993716"},{"issue":"4","key":"11_CR39","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1561\/0400000057","volume":"8","author":"A Mehta","year":"2013","unstructured":"Mehta, A.: Online matching and ad allocation. Found. Trends Theor. Comput. Sci. 8(4), 265\u2013368 (2013)","journal-title":"Found. Trends Theor. Comput. Sci."},{"issue":"5","key":"11_CR40","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1145\/1284320.1284321","volume":"54","author":"A Mehta","year":"2007","unstructured":"Mehta, A., Saberi, A., Vazirani, U.V., Vazirani, V.V.: Adwords and generalized online matching. J. ACM 54(5), 265\u2013368 (2007)","journal-title":"J. ACM"},{"key":"11_CR41","doi-asserted-by":"crossref","unstructured":"Meyerson, A., Nanavati, A., Poplawski, L.J.: Randomized online algorithms for minimum metric bipartite matching. In: Proceedings of the 7th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 954\u2013959 (2006)","DOI":"10.1145\/1109557.1109662"},{"key":"11_CR42","doi-asserted-by":"crossref","unstructured":"Naor, J., Wajc, D.: Near-optimum online ad allocation for targeted advertising. In: Proceedings of the 16th ACM Conference on Economics and Computation (EC), pp. 131\u2013148 (2015)","DOI":"10.1145\/2764468.2764482"},{"issue":"1","key":"11_CR43","first-page":"39","volume":"12","author":"YA Pignolet","year":"2010","unstructured":"Pignolet, Y.A., Schmid, S., Wattenhofer, R.: Tight bounds for delay-sensitive aggregation. Discret. Math. Theor. Comput. Sci. 12(1), 39\u201358 (2010)","journal-title":"Discret. Math. Theor. Comput. Sci."},{"issue":"4","key":"11_CR44","doi-asserted-by":"publisher","first-page":"676","DOI":"10.1137\/0210050","volume":"10","author":"EM Reingold","year":"1981","unstructured":"Reingold, E.M., Tarjan, R.E.: On a greedy heuristic for complete matching. SIAM J. Comput. 10(4), 676\u2013681 (1981)","journal-title":"SIAM J. Comput."}],"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-319-89441-6_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T12:20:14Z","timestamp":1710246014000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-89441-6_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319894409","9783319894416"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-89441-6_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"31 March 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":"Vienna","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Austria","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 September 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 September 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"waoa2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/algo2017.ac.tuwien.ac.at\/waoa","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}