Spatio-temporal Control for Dynamic Routing Games

In this paper, we study dynamic routing games where the decision of an user is spatio-temporal control. Each user ships its demand over time on a shared resource. We investigate the equilibrium of such systems and show the existence and uniqueness of equilibrium. In the second part, we study a stochastic congestion games where there is only one shared resource and the traffic is indivisible. The information structure that we consider is such that each user knows the state of its own buffer but not aware of states and the actions taken by other users. The game can be described as a game with random environment. We characterize the structure of equilibria policies using linear programming. We also study the properties of equilibrium considering another model for stochastic congestion game in which a fixed amount of divisible demand arrives each day. This demand can shipped to destination by sending some part today and remaining the next day.

[1]  Ariel Orda,et al.  Competitive routing in multiuser communication networks , 1993, TNET.

[2]  Balakrishna J. Prabhu,et al.  Price of Anarchy in Non-Cooperative Load Balancing , 2010, 2010 Proceedings IEEE INFOCOM.

[3]  Tim Roughgarden,et al.  Algorithmic Game Theory , 2007 .

[4]  Eitan Altman,et al.  Competitive routing in networks with polynomial cost , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[5]  Eitan Altman,et al.  Constrained cost-coupled stochastic games with independent state processes , 2007, Oper. Res. Lett..

[6]  Eitan Altman,et al.  Competitive routing in networks with polynomial costs , 2002, IEEE Trans. Autom. Control..

[7]  K. Park,et al.  Quality of service provision in noncooperative networks with diverse user requirements , 2000, Decis. Support Syst..

[8]  Alain Haurie,et al.  On the relationship between Nash - Cournot and Wardrop equilibria , 1983, Networks.

[9]  R. Cominetti,et al.  Decision , Risk & Operations Working Papers Series The Impact of Oligopolistic Competition in Networks , 2006 .

[10]  R. Rosenthal.  A class of games possessing pure-strategy Nash equilibria , 1973 .

[11]  B. W. Wie.  Dynamic User Optimal Traffic Assignment on Congested Multi-destination Network , 1990 .

[12]  J. G. Wardrop,et al.  Some Theoretical Aspects of Road Traffic Research , 1952 .

[13]  L. Shapley,et al.  REGULAR ARTICLEPotential Games , 1996 .

[14]  L. Shapley,et al.  Potential Games , 1994 .