Online Stochastic Max-Weight Bipartite Matching: Beyond Prophet Inequalities

02/20/2021
by   Christos Papadimitriou, et al.
0

The rich literature on online Bayesian selection problems has long focused on so-called prophet inequalities, which compare the gain of an online algorithm to that of a "prophet" who knows the future. An equally-natural, though significantly less well-studied benchmark is the optimum online algorithm, which may be omnipotent (i.e., computationally-unbounded), but not omniscient. What is the computational complexity of the optimum online? How well can a polynomial-time algorithm approximate it? Motivated by applications in ride hailing, we study the above questions for the online stochastic maximum-weight matching problem under vertex arrivals. This problem was recently introduced by Ezra, Feldman, Gravin and Tang (EC'20), who gave a 1/2-competitive algorithm for it. This is the best possible ratio, as this problem is a generalization of the original single-item prophet inequality. We present a polynomial-time algorithm which approximates optimal online within a factor of 0.51, beating the best-possible prophet inequality. At the core of our result are a new linear program formulation, an algorithm that tries to match the arriving vertices in two attempts, and an analysis that bounds the correlation resulting from the second attempts. In contrast, we show that it is PSPACE-hard to approximate this problem within some constant α < 1.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/24/2021

Online Stochastic Matching, Poisson Arrivals, and the Natural Linear Program

We study the online stochastic matching problem. Consider a bipartite gr...
research
04/05/2021

Prophet Inequalities for Matching with a Single Sample

We consider the prophet inequality problem for (not necessarily bipartit...
research
06/02/2022

Max-Weight Online Stochastic Matching: Improved Approximations Against the Online Benchmark

In this paper, we study max-weight stochastic matchings on online bipart...
research
12/28/2022

A polynomial time iterative algorithm for matching Gaussian matrices with non-vanishing correlation

Motivated by the problem of matching vertices in two correlated Erdős-Ré...
research
07/09/2019

Vertex-weighted Online Stochastic Matching with Patience Constraints

Online Bipartite Matching is a classic problem introduced by Karp, Vazir...
research
02/23/2020

Online Stochastic Max-Weight Matching: prophet inequality for vertex and edge arrival models

We provide prophet inequality algorithms for online weighted matching in...
research
10/21/2022

Two-stage Stochastic Matching and Pricing with Applications to Ride Hailing

Matching and pricing are two critical levers in two-sided marketplaces t...

Please sign up or login with your details

Forgot password? Click here to reset