We consider the bipartite matching model of customers and servers introduced
by Caldentey, Kaplan, and Weiss (Adv. Appl. Probab., 2009). Customers and
servers play symmetrical roles. There is a finite set C resp. S, of customer,
resp. server, classes. Time is discrete and at each time step, one customer and
one server arrive in the system according to a joint probability measure on
CxS, independently of the past. Also, at each time step, pairs of matched
customer and server, if they exist, depart from the system. Authorized
matchings are given by a fixed bipartite graph.