Uncertainty Whiteboard Seminar

 A FCFS Bipartite Infinite Matching Model and Applications

Consider types C={c1,c2,. . .,cI}, and S={s1,s2,. . . ,sJ}, and a bipartite compatibility graph between C and S.  Given an infinite sequence of i.i.d. c’s and an infinite sequence of i.i.d. s’s, we consider matching the two sequences according to the compatibility graph, where we use a first come first served policy (FCFS).  This model, which appears to be quite complicated at first glance turns out to be extremely tractable, yielding results on uniqueness, reversibility, and stationary probabilities. The model is helpful in analyzing some complex applied probability models.  We will discuss its applications to the analysis of organ transplants and to the analysis of skill based service in call centers. Survey of Joint Work With:  Ed Kaplan, Rene Caldentey, Ivo Adan, Marko Boon, Ana Busic, Jean Mairesse, Dongyuan Zhan, Hanqin Zhang and Yuval Nov.