DeepAI AI Chat
Log In Sign Up

Optimal Control of Dynamic Bipartite Matching Models

by   Arnaud Cadas, et al.

A dynamic bipartite matching model is given by a bipartite matching graph which determines the possible matchings between the various types of supply and demand items. Both supply and demand items arrive to the system according to a stochastic process. Matched pairs leave the system and the others wait in the queues, which induces a holding cost. We model this problem as a Markov Decision Process and study the discounted cost and the average cost case. We first consider a model with two types of supply and two types of demand items with an N matching graph. For linear cost function, we prove that an optimal matching policy gives priority to the end edges of the matching graph and is of threshold type for the diagonal edge. In addition, for the average cost problem, we compute the optimal threshold value. According to our preliminary numerical experiments, threshold-type policies performs also very well for more general bipartite graphs.


page 1

page 2

page 3

page 4


Dynamic Weighted Matching with Heterogeneous Arrival and Departure Rates

We study a dynamic non-bipartite matching problem. There is a fixed set ...

Flexibility can hurt dynamic matching system performance

We study the performance of general dynamic matching models. This model ...

Dynamic Matching under Spatial Frictions

We consider demand and supply which arise i.i.d. uniformly in the unit h...

Stochastic dynamic matching: A mixed graph-theory and linear-algebra approach

The stochastic dynamic matching problem has recently drawn attention in ...

Optimal Load Balanced Demand Distribution under Overload Penalties

Input to the Load Balanced Demand Distribution (LBDD) consists of the fo...

Stochastic Non-Bipartite Matching Models and Order-Independent Loss Queues

The need for matching items with one another while meeting assignment co...