Self-Interested Routing in Queuing Networks
Stanford University GSB Research Paper No. 1782 (R)
39 Pages Posted: 13 Mar 2004
Date Written: January 2004
We study self-interested routing in stochastic networks, taking into account the discrete stochastic dynamics of such networks. We analyze a two station multiclass queueing network in which the system manager chooses the scheduling rule used, and individual customers choose routes in a self-interested manner. We show that this network can be unstable in Nash equilibrium under some scheduling rules. We also design a non-trivial scheduling rule that negates the performance degradation due to self-interested routing and achieves a Nash equilibrium with performance comparable to the first-best solution.
Suggested Citation: Suggested Citation