TY - GEN
T1 - Minimum cost perfect matching with delays for two sources
AU - Emek, Yuval
AU - Shapiro, Yaacov
AU - Wang, Yuyi
N1 - Publisher Copyright:
© Springer International Publishing AG 2017.
PY - 2017
Y1 - 2017
N2 - We study a version of the online min-cost perfect matching with delays (MPMD) problem recently introduced by Emek et al. (STOC 2016). In this problem, requests arrive in a continuous time online fashion and should be matched to each other. Each request emerges from one out of n sources, with metric inter-source distances. The algorithm is allowed to delay the matching of requests, but with a cost: when matching two requests, it pays the distance between their respective sources and the time each request has waited from its arrival until it was matched. In this paper, we consider the special case of n = 2 sources that captures the essence of the match-or-wait challenge (cf. rent-or-buy). It turns out that even for this degenerate metric space, the problem is far from triv-ial. Our results include a deterministic 3-competitive online algorithm for this problem, a proof that no deterministic online algorithm can have competitive ratio smaller than 3, and a proof that the same lower bound applies also for the restricted family of memoryless randomized algorithms.
AB - We study a version of the online min-cost perfect matching with delays (MPMD) problem recently introduced by Emek et al. (STOC 2016). In this problem, requests arrive in a continuous time online fashion and should be matched to each other. Each request emerges from one out of n sources, with metric inter-source distances. The algorithm is allowed to delay the matching of requests, but with a cost: when matching two requests, it pays the distance between their respective sources and the time each request has waited from its arrival until it was matched. In this paper, we consider the special case of n = 2 sources that captures the essence of the match-or-wait challenge (cf. rent-or-buy). It turns out that even for this degenerate metric space, the problem is far from triv-ial. Our results include a deterministic 3-competitive online algorithm for this problem, a proof that no deterministic online algorithm can have competitive ratio smaller than 3, and a proof that the same lower bound applies also for the restricted family of memoryless randomized algorithms.
UR - http://www.scopus.com/inward/record.url?scp=85018416636&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-57586-5_18
DO - 10.1007/978-3-319-57586-5_18
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:85018416636
SN - 9783319575858
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 209
EP - 221
BT - Algorithms and Complexity - 10th International Conference, CIAC 2017, Proceedings
A2 - Fotakis, Dimitris
A2 - Pagourtzis, Aris
A2 - Paschos, Vangelis Th.
T2 - 10th International Conference on Algorithms and Complexity, CIAC 2017
Y2 - 24 May 2017 through 26 May 2017
ER -