Online Hypergraph Matching with Delays

by   Marco Pavone, et al.

We study an online hypergraph matching problem with delays, motivated by ridesharing applications. In this model, users enter a marketplace sequentially, and are willing to wait up to d timesteps to be matched, after which they will leave the system in favor of an outside option. A platform can match groups of up to k users together, indicating that they will share a ride. Each group of users yields a match value depending on how compatible they are with one another. As an example, in ridesharing, k is the capacity of the service vehicles, and d is the amount of time a user is willing to wait for a driver to be matched to them. We present results for both the utility maximization and cost minimization variants of the problem. In the utility maximization setting, the optimal competitive ratio is 1/d whenever k ≥ 3, and is achievable in polynomial-time for any fixed k. In the cost minimization variation, when k = 2, the optimal competitive ratio for deterministic algorithms is 3/2 and is achieved by a polynomial-time thresholding algorithm. When k>2, we show that a polynomial-time randomized batching algorithm is (2 - 1/d) log k-competitive, and it is NP-hard to achieve a competitive ratio better than log k - O (loglog k).



There are no comments yet.


page 1

page 2

page 3

page 4


Deterministic Min-Cost Matching with Delays

We consider the online Minimum-Cost Perfect Matching with Delays (MPMD) ...

A Primal-Dual Online Deterministic Algorithm for Matching with Delays

In the Min-cost Perfect Matching with Delays (MPMD) problem, 2 m request...

Matching on the line admits no o(√(log n))-competitive algorithm

We present a simple proof that the competitive ratio of any randomized o...

Online k-Way Matching with Delays and the H-Metric

In this paper, we study k-Way Min-cost Perfect Matching with Delays - th...

Online Max-min Fair Allocation

We study an online version of the max-min fair allocation problem for in...

Orienting (hyper)graphs under explorable stochastic uncertainty

Given a hypergraph with uncertain node weights following known probabili...

Regular Expressions with Backreferences: Polynomial-Time Matching Techniques

Regular expressions with backreferences (regex, for short), as supported...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.