On the Optimal Design of a Bipartite Matching System
In this talk, we explore the optimal design of matching topologies for a multi-class multi-server queueing system in which each customer class has a specific preference over server types. We investigate the performance of the system from the perspective of a central planner who must decide the set of feasible customer-server pairs that can be matched together under fairness constraints for both customers and servers.
Joint work with Philipp Afeche (U. Toronto) and Varun Gupta (U. Chicago)
