Cooperative networks games with elastic demands

We present here a pricing model which is an extension of the cooperative game concept and which includes a notion of elastic demand. We present some existence results as well as an algorithm, and we conclude by discussing a specific problem related to network pricing.

[1]  Gilbert Laporte,et al.  Competitive Location Models: A Framework and Bibliography , 1993, Transp. Sci..

[2]  Eitan Altman,et al.  Constrained traffic equilibrium in routing , 2003, IEEE Trans. Autom. Control..

[3]  Pradeep Dubey,et al.  Totally balanced games arising from controlled programming problems , 1984, Math. Program..

[4]  Costas Courcoubetis,et al.  Pricing Communication Networks: Economics, Technology and Modelling (Wiley Interscience Series in Systems and Optimization) , 2003 .

[5]  Luiz A. DaSilva,et al.  Pricing for QoS-enabled networks: A survey , 2000, IEEE Communications Surveys & Tutorials.

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

[7]  Hisao Kameda,et al.  Mixed equilibrium (ME) for multiclass routing games , 2002, IEEE Trans. Autom. Control..

[8]  Gur Huberman,et al.  The nucleolus and the essential coalitions , 1980 .

[9]  Xi-Ren Cao,et al.  Internet pricing with a game theoretical approach: concepts and examples , 2002, TNET.

[10]  Eitan Altman,et al.  Telecommunications network equilibrium with price and quality-of-service characteristics , 2003 .

[11]  Richard J. La,et al.  Network pricing using game theoretic approach , 1999, Proceedings of the 38th IEEE Conference on Decision and Control (Cat. No.99CH36304).

[12]  Frank Kelly,et al.  Charging and rate control for elastic traffic , 1997, Eur. Trans. Telecommun..

[13]  C. G. Bird,et al.  On cost allocation for a spanning tree: A game theoretic approach , 1976, Networks.

[14]  E. Altman,et al.  Mixed Equilibrium for Multiclass Routing Games , 2001 .

[15]  J. Nash,et al.  NON-COOPERATIVE GAMES , 1951, Classics in Game Theory.

[16]  Michael Maschler,et al.  Spanning network games , 1998, Int. J. Game Theory.

[17]  E. Zeidler,et al.  Fixed-point theorems , 1986 .

[18]  Eitan Altman,et al.  A survey on networking games in telecommunications , 2006, Comput. Oper. Res..

[19]  Eitan Zemel,et al.  Totally Balanced Games and Games of Flow , 1982, Math. Oper. Res..

[20]  C.G.A.M. van den Nouweland,et al.  A game theoretic approach to problems in telecommunication , 1996 .

[21]  Arie Tamir,et al.  On the core of network synthesis games , 1991, Math. Program..

[22]  Phillip J. Lederer.  A Competitive Network Design Problem with Pricing , 1993, Transp. Sci..

[23]  Costas Courcoubetis,et al.  Pricing Communication Networks , 2003 .

[24]  E. Altman.  A MARKOV GAME APPROACH FOR OPTIMAL ROUTING INTO A QUEUEING NETWORK , 1999 .

[25]  Nimrod Megiddo,et al.  Cost allocation for steiner trees , 1978, Networks.

[26]  Ariel Orda,et al.  Capacity allocation under noncooperative routing , 1997, IEEE Trans. Autom. Control..

[27]  Daniel Granot,et al.  On the core and nucleolus of minimum cost spanning tree games , 1984, Math. Program..

[28]  Moshe Haviv.  The Aumann-Shapley price mechanism for allocating congestion costs , 2001, Oper. Res. Lett..

[29]  Daniel Granot,et al.  On Some Network Flow Games , 1992, Math. Oper. Res..

[30]  Richard J. Gibbens,et al.  Resource pricing and the evolution of congestion control , 1999, at - Automatisierungstechnik.

[31]  Eitan Altman,et al.  Special issue on crossovers between transportation and telecommunication modeling , 2004 .