Min-Cost bipartite perfect matching with delays

Itai Ashlagi, Yossi Azar, Moses Charikar, Ashish Chiplunkar, Ofir Geri, Haim Kaplan, Rahul Makhijani, Yuyi Wang, Roger Wattenhofer

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

In the min-cost bipartite perfect matching with delays (MBPMD) problem, requests arrive online at points of a finite metric space. Each request is either positive or negative and has to be matched to a request of opposite polarity. As opposed to traditional online matching problems, the algorithm does not have to serve requests as they arrive, and may choose to match them later at a cost. Our objective is to minimize the sum of the distances between matched pairs of requests (the connection cost) and the sum of the waiting times of the requests (the delay cost). This objective exhibits a natural tradeoff between minimizing the distances and the cost of waiting for better matches. This tradeoff appears in many real-life scenarios, notably, ride-sharing platforms. MBPMD is related to its non-bipartite variant, min-cost perfect matching with delays (MPMD), in which each request can be matched to any other request. MPMD was introduced by Emek et al. (STOC'16), who showed an O(log2 n + log )-competitive randomized algorithm on n-point metric spaces with aspect ratio . Our contribution is threefold. First, we present a new lower bound construction for MPMD and MBPMD.We get a lower bound of q log n log log n on the competitive ratio of any randomized algorithm for MBPMD. For MPMD, we improve the lower bound from (plog n) (shown by Azar et al., SODA'17) to log n log log n , thus, almost matching their upper bound of O(log n). Second, we adapt the algorithm of Emek et al. to the bipartite case, and provide a simplified analysis that improves the competitive ratio to O(log n). The key ingredient of the algorithm is an O(h)- competitive randomized algorithm for MBPMD on weighted trees of height h. Third, we provide an O(h)-competitive deterministic algorithm for MBPMD on weighted trees of height h. This algorithm is obtained by adapting the algorithm for MPMD by Azar et al. to the apparently more complicated bipartite setting.

Original languageEnglish
Title of host publicationApproximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 20th International Workshop, APPROX 2017 and 21st International Workshop, RANDOM 2017
EditorsJose D. P. Rolim, Klaus Jansen, David P. Williamson, Santosh S. Vempala
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959770446
DOIs
StatePublished - 1 Aug 2017
Event20th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2017 and the 21st International Workshop on Randomization and Computation, RANDOM 2017 - Berkeley, United States
Duration: 16 Aug 201718 Aug 2017

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume81
ISSN (Print)1868-8969

Conference

Conference20th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2017 and the 21st International Workshop on Randomization and Computation, RANDOM 2017
Country/TerritoryUnited States
CityBerkeley
Period16/08/1718/08/17

Keywords

  • Bipartite matching
  • Competitive analysis
  • Online algorithms with delayed service

Fingerprint

Dive into the research topics of 'Min-Cost bipartite perfect matching with delays'. Together they form a unique fingerprint.

Cite this