## Abstract

Motivated by queues with multitype servers and multitype customers, we consider an infinite sequence of items of types C = (c _{1}, ⋯, c _{I}), and another infinite sequence of items of types S =(s _{1}, ⋯, s _{J}), and a bipartite graph G of allowable matches between the types. We assume that the types of items in the two sequences are independent and identically distributed (i.i.d.) with given probability vectors α, β Matching the two sequences on a first-come, first-served basis defines a unique infinite matching between the sequences. For (c _{i}1, s _{j}) ∈ G we define the matching rate r _{ci}, _{sj} as the long-term fraction of c _{i}, s _{j} matches in the infinite matching, if it exists. We describe this system by a multidimensional countable Markov chain, obtain conditions for ergodicity, and derive its stationary distribution, which is, most surprisingly, of product form. We show that if the chain is ergodic, then the matching rates exist almost surely, and we give a closed-form formula to calculate them. We point out the connection of this model to some queueing models.

Original language | English |
---|---|

Pages (from-to) | 475-489 |

Number of pages | 15 |

Journal | Operations Research |

Volume | 60 |

Issue number | 2 |

DOIs | |

State | Published - Mar 2012 |

## Keywords

- First-come
- First-served policy
- Infinite bipartite matching
- Infinite bipartite matching rates
- Markov chains
- Multitype customers and servers
- Product-form solution
- Service system

## ASJC Scopus subject areas

- Computer Science Applications
- Management Science and Operations Research