Reversibility and further properties of FCFS infinite bipartite matching
Résumé
The model of FCFS infinite bipartite matching was introduced in [10]. In this model there is a sequence of items that are chosen i.i.d. from C = {c1,. .. , cI } and an independent sequence of items that are chosen i.i.d. from S = {s1,. .. , sJ }, and a bipartite compatibility graph G between C and S. Items of the two sequences are matched according to the compatibility graph, and the matching is FCFS, each item in the one sequence is matched to the earliest compatible unmatched item in the other sequence. In [4] a Markov chain associated with the matching was analyzed, a condition for stability was verified, a product form stationary distribution was derived and and the rates rc i ,s j of matches between compatible types ci and sj were calculated. In the current paper we present further results on this model. We use a Loynes type scheme to show that if the system is stable there is a unique matching of the sequence over all the integers. We show dynamic reversibility: if in every matched pair we exchange the positions of the items the resulting permuted sequences are again independent and i.i.d., and the matching between them is FCFS in reversed time. We use these results to derive stationary distributions of various Markov chains associated with the model. We also calculate the distribution of the link lengths between matched items.