Mixed equilibrium (ME) for multiclass routing games

We consider a network shared by noncooperative two types of users, group users and individual users. Each user of the first type has a significant impact on the load of the network, whereas a user of the second type does not. Both group users as well as individual users choose their routes so as to minimize their costs. We further consider the case that the users may have side constraints. We study the concept of mixed equilibrium (mixing of Nash equilibrium and Wardrop equilibrium). We establish its existence and some conditions for its uniqueness. Then, we apply the mixed equilibrium to a parallel links network and to a case of load balancing.

[1]  Eitan Altman,et al.  Uniqueness of solutions for optimal static routing in multi-class open networks , 1998 .

[2]  Hisao Kameda,et al.  Paradoxes in Performance Optimization of Distributed Systems , 2000 .

[3]  Stella C. Dafermos,et al.  Traffic assignment problem for a general network , 1969 .

[4]  Hisao Kameda,et al.  ANOMALOUS RELATIONS AMONG VARIOUS PERFORMANCE OBJECTIVES IN DISTRIBUTED COMPUTER SYSTEMS 1 , 1997 .

[5]  A. Nagurney,et al.  ON SOME TRAFFIC EQUILIBRIUM THEORY PARADOXES , 1984 .

[6]  Torbjörn Larsson,et al.  Side constrained traffic equilibrium models: analysis, computation and applications , 1999 .

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

[8]  J. Goodman.  Note on Existence and Uniqueness of Equilibrium Points for Concave N-Person Games , 1965 .

[9]  Patrick T. Harker,et al.  Multiple Equilibrium Behaviors on Networks , 1988, Transp. Sci..

[10]  J G Wardrop,et al.  CORRESPONDENCE. SOME THEORETICAL ASPECTS OF ROAD TRAFFIC RESEARCH. , 1952 .

[11]  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).

[12]  Eitan Altman,et al.  Routing into Two Parallel Links: Game-Theoretic Distributed Algorithms , 2001, J. Parallel Distributed Comput..

[13]  Jie Li,et al.  Optimal Load Balancing in Distributed Computer Systems , 1997 .

[14]  Piyush Gupta,et al.  A system and traffic dependent adaptive routing algorithm for ad hoc networks , 1997, Proceedings of the 36th IEEE Conference on Decision and Control.

[15]  Hisao Kameda,et al.  A case where a paradox like Braess's occurs in the Nash equilibrium but does not occur in the Wardrop equilibrium - a situation of load balancing in distributed computer systems , 1999, Proceedings of the 38th IEEE Conference on Decision and Control (Cat. No.99CH36304).

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

[17]  Odile Pourtallier,et al.  Analytic study of distributed optima coexisting within a network of homogeneous computers , 2000 .

[18]  B. Wie.  A differential game approach to the dynamic mixed behavior traffic network equilibrium problem , 1995 .

[19]  Eitan Altman,et al.  Braess-like paradoxes of nash equilibria for load balancing in distributed computer systems , 1998 .

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

[21]  Richard J. La,et al.  Optimal routing control: game theoretic approach , 1997, Proceedings of the 36th IEEE Conference on Decision and Control.

[22]  D. Kinderlehrer,et al.  An introduction to variational inequalities and their applications , 1980 .

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

[24]  Ariel Orda,et al.  Architecting noncooperative networks , 1995, Eighteenth Convention of Electrical and Electronics Engineers in Israel.