Greedy Bipartite Matching in Random Type Poisson Arrival Model

05/02/2018
by   Allan Borodin, et al.
0

We introduce a new random input model for bipartite matching which we call the Random Type Poisson Arrival Model. Just like in the known i.i.d. model (introduced by Feldman et al. 2009), online nodes have types in our model. In contrast to the adversarial types studied in the known i.i.d. model, following the random graphs studied in Mastin and Jaillet 2016, in our model each type graph is generated randomly by including each offline node in the neighborhood of an online node with probability c/n independently. In our model, nodes of the same type appear consecutively in the input and the number of times each type node appears is distributed according to the Poisson distribution with parameter 1. We analyze the performance of the simple greedy algorithm under this input model. The performance is controlled by the parameter c and we are able to exactly characterize the competitive ratio for the regimes c = o(1) and c = ω(1). We also provide a precise bound on the expected size of the matching in the remaining regime of constant c. We compare our results to the previous work of Mastin and Jaillet who analyzed the simple greedy algorithm in the G_n,n,p model where each online node type occurs exactly once. We essentially show that the approach of Mastin and Jaillet can be extended to work for the Random Type Poisson Arrival Model, although several nontrivial technical challenges need to be overcome. Intuitively, one can view the Random Type Poisson Arrival Model as the G_n,n,p model with less randomness; that is, instead of each online node having a new type, each online node has a chance of repeating the previous type.

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
01/10/2018

Online Maximum Matching with Recourse

We study the online maximum matching problem with recourse in a model in...
research
02/07/2022

Improved Bounds for Fractional Online Matching Problems

Online bipartite matching with one-sided arrival and its variants have b...
research
08/03/2022

A Nonparametric Framework for Online Stochastic Matching with Correlated Arrivals

The design of online policies for stochastic matching and revenue manage...
research
10/13/2021

Online Bipartite Matching with Reusable Resources

We study the classic online bipartite matching problem with a twist: off...
research
02/16/2023

Sample-Based Online Generalized Assignment Problem with Unknown Poisson Arrivals

We study an edge-weighted online stochastic Generalized Assignment Probl...
research
11/27/2020

Group-level Fairness Maximization in Online Bipartite Matching

In typical online matching problems, the goal is to maximize the number ...

Please sign up or login with your details

Forgot password? Click here to reset