A Lagrangian approach to constrained potential games: Theory and examples

In this paper, we use a Lagrangian approach to solve for Nash equilibrium in a continuous non-cooperative game with coupled constraints. We discuss the necessary and the sufficient conditions to characterize the equilibrium of the constrained games. In addition, we discuss the existence and uniqueness of the equilibrium. We focus on the class of potential games and point out a relation between potential games and centralized optimization. Based on these results, we illustrate the Lagrangian approach with symmetric quadratic games and briefly discuss the notion of game duality. In addition, we discuss two engineering potential game examples from network rate control and wireless power control, for which the Lagrangian approach simplifies the solution process.

[1]  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.

[2]  Tansu Alpcan,et al.  Power control for multicell CDMA wireless networks: A team optimization approach , 2005, Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt'05).

[3]  Katta G. Murty,et al.  Nonlinear Programming Theory and Algorithms , 2007, Technometrics.

[4]  Catherine Rosenberg,et al.  A game theoretic framework for bandwidth allocation and pricing in broadband networks , 2000, TNET.

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

[6]  J. Krawczyk,et al.  Numerical solutions to Nash-Cournot equilibria in coupled constraint electricity markets , 2004, IEEE Transactions on Power Systems.

[7]  Dimitri P. Bertsekas,et al.  Network optimization : continuous and discrete models , 1998 .

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

[9]  Sergio Barbarossa,et al.  Potential Games: A Framework for Vector Power Control Problems With Coupled Constraints , 2006, 2006 IEEE International Conference on Acoustics Speech and Signal Processing Proceedings.

[10]  S. Shenker Fundamental Design Issues for the Future Internet , 1995 .

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

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

[13]  T. Başar,et al.  A Stackelberg Network Game with a Large Number of Followers , 2002 .

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

[15]  Ness B. Shroff,et al.  Non-convex optimization and rate control for multi-class services in the Internet , 2005, IEEE/ACM Transactions on Networking.

[16]  S. Zlobec Parametric programming: An illustrative mini encyclopedia ∗ , 2000 .

[17]  M. L. Baughman,et al.  An Empirical Study of Applied Game Theory: Transmission Constrained Cournot Behavior , 2002, IEEE Power Engineering Review.

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

[19]  Tamer Basar,et al.  Optimal Nonlinear Pricing for a Monopolistic Network Service Provider with Complete and Incomplete Information , 2007, IEEE Journal on Selected Areas in Communications.

[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]  Eitan Altman,et al.  A survey on networking games in telecommunications , 2006, Comput. Oper. Res..

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

[23]  Quanyan Zhu,et al.  Stackelberg game approach to constrained OSNR nash game in WDM optical networks , 2008, 2008 American Control Conference.

[24]  Frank Kelly,et al.  Rate control for communication networks: shadow prices, proportional fairness and stability , 1998, J. Oper. Res. Soc..

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

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

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