A Nonparametric Framework for Online Stochastic Matching with Correlated Arrivals

by   Ali Aouad, et al.

The design of online policies for stochastic matching and revenue management settings is usually bound by the Bayesian prior that the demand process is formed by a fixed-length sequence of queries with unknown types, each drawn independently. This assumption of serial independence implies that the demand of each type, i.e., the number of queries of a given type, has low variance and is approximately Poisson-distributed. Thus, matching policies are often based on "fluid" LPs that only use the expectations of these distributions. This paper explores alternative stochastic models for online matching that allow for nonparametric, higher variance demand distributions. We propose two new models, INDEP and CORREL, that relax the serial independence assumption in different ways by combining a nonparametric distribution for the demand with standard assumptions on the arrival patterns – adversarial or random-order. In our INDEP model, the demand for each type follows an arbitrary distribution, while being mutually independent across different types. In our CORREL model, the total demand follows an arbitrary distribution, and conditional on the sequence length, the type of each query is drawn independently. In both settings, we show that the fluid LP relaxation based on only expected demands can be an arbitrarily bad benchmark for algorithm design. We develop tighter LP relaxations for the INDEP and CORREL models that leverage the exact distribution of the demand, leading to matching algorithms that achieve constant-factor performance guarantees under adversarial and random-order arrivals. More broadly, our paper provides a data-driven framework for expressing demand uncertainty (i.e., variance and correlations) in online stochastic matching models.


page 1

page 2

page 3

page 4


Bipartite Stochastic Matching: Online, Random Order, and I.I.D. Models

Within the context of stochastic probing with commitment, we consider th...

Stochastic Online Metric Matching

We study the minimum-cost metric perfect matching problem under online i...

Greedy Bipartite Matching in Random Type Poisson Arrival Model

We introduce a new random input model for bipartite matching which we ca...

Prophet Inequality Matching Meets Probing with Commitment

Within the context of stochastic probing with commitment, we consider th...

Online Allocation of Reusable Resources: Achieving Optimal Competitive Ratio

We study the problem of allocating a given set of resources to sequentia...

Stackelberg Independence

The standard model of sequential capacity choices is the Stackelberg qua...

Online Inventory Problems: Beyond the i.i.d. Setting with Online Convex Optimization

We study multi-product inventory control problems where a manager makes ...

Please sign up or login with your details

Forgot password? Click here to reset