Theory of Linear Games with Constraints and Its Application to Power Control of Optical Networks

In this paper, we introduce a class of linear non- cooperative games with linearly coupled constraints. It bears striking connections with classical linear systems theory and finds itself pervasively used in network engineering applications. In the second part of the paper, we will illustrate this type of games by an application from OSNR-based power control in optical networks, where we can view the slack variables as fictitious players. This powerful interpretation allows us to bridge over the theory and the issue of implementation in engineering.

[1]  T. Başar,et al.  Dynamic Noncooperative Game Theory, 2nd Edition , 1998 .

[2]  Lacra Pavel,et al.  A noncooperative game approach to OSNR optimization in optical networks , 2006, IEEE Transactions on Automatic Control.

[3]  Ariel Rubinstein,et al.  A Course in Game Theory , 1995 .

[4]  T. Başar,et al.  Dynamic Noncooperative Game Theory , 1982 .

[5]  R. Srikant,et al.  Revenue-maximizing pricing and capacity expansion in a many-users regime , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[6]  E. Maasland,et al.  Auction Theory , 2021, Springer Texts in Business and Economics.

[7]  Georgia Perakis,et al.  The "Price of Anarchy" Under Nonlinear and Asymmetric Costs , 2007, Math. Oper. Res..

[8]  P. Morris Introduction to Game Theory , 1994 .

[9]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[10]  Eitan Altman,et al.  CDMA Uplink Power Control as a Noncooperative Game , 2002, Wirel. Networks.

[11]  F. Forghieri,et al.  Simple model of optical amplifier chains to evaluate penalties in WDM systems , 1996, Optical Fiber Communications, OFC..

[12]  Lacra Pavel,et al.  GEN02-1: Hierarchical Iterative Algorithm for a Coupled Constrained OSNR Nash Game , 2006, IEEE Globecom 2006.

[13]  Lacra Pavel,et al.  An extension of duality to a game-theoretic framework , 2007, Autom..

[14]  J. Nash Equilibrium Points in N-Person Games. , 1950, Proceedings of the National Academy of Sciences of the United States of America.

[15]  Pradeep Dubey,et al.  Inefficiency of Nash Equilibria , 1986, Math. Oper. Res..

[16]  Sanjo Zlobec,et al.  Stable Parametric Programming , 2001 .

[17]  Tim Roughgarden,et al.  Bounding the inefficiency of equilibria in nonatomic congestion games , 2004, Games Econ. Behav..

[18]  K. Schittkowski,et al.  NONLINEAR PROGRAMMING , 2022 .

[19]  Cem U. Saraydar,et al.  Efficient power control via pricing in wireless data networks , 2002, IEEE Trans. Commun..

[20]  Lacra Pavel,et al.  Global Convergence of An Iterative Gradient Algorithm for The Nash Equilibrium in An Extended OSNR Game , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[21]  Robert J. Plemmons,et al.  Nonnegative Matrices in the Mathematical Sciences , 1979, Classics in Applied Mathematics.

[22]  José R. Correa,et al.  On the Inefficiency of Equilibria in Congestion Games , 2005, IPCO.

[23]  Quanyan Zhu,et al.  Solving constrained OSNR Nash game in WDM optical networks with a fictitious player , 2007, 2007 Fourth International Conference on Broadband Communications, Networks and Systems (BROADNETS '07).

[24]  Lacra Pavel OSNR optimization in optical networks: modeling and distributed algorithms via a central cost approach , 2006, IEEE Journal on Selected Areas in Communications.