Distributed Computation of Equilibria in Monotone Nash Games via Iterative Regularization Techniques

We consider the development of single-timescale schemes for the distributed computation of equilibria associated with Nash games in which each player solves a convex program. Equilibria associated with such games are wholly captured by the solution set of a variational inequality. Our focus is on a class of games, termed monotone Nash games, that lead to monotone variational inequalities. Distributed extensions of standard approaches for solving such variational problems are characterized by two challenges: (1) Unless suitable assumptions (such as strong monotonicity) are imposed on the mapping arising in the specification of the variational inequality, iterative methods often require the solution of a sequence of regularized problems, a naturally two-timescale process that is harder to implement in practice. (2) Additionally, algorithm parameters for all players (such as steplengths and regularization parameters) have to be chosen centrally and communicated to all players; importantly, these parameters c...

[1]  F. Browder Existence and approximation of solutions of nonlinear variational inequalities. , 1966, Proceedings of the National Academy of Sciences of the United States of America.

[2]  R. Rockafellar Monotone Operators and the Proximal Point Algorithm , 1976 .

[3]  Michael C. Ferris,et al.  Finite termination of the proximal point algorithm , 1991, Math. Program..

[4]  Daniel Ralph,et al.  Global Convergence of Damped Newton's Method for Nonsmooth Equations via the Path Search , 1994, Math. Oper. Res..

[5]  E. G. Golʹshteĭn,et al.  Modified Lagrangians and monotone maps in optimization , 1996 .

[6]  S. Billups Algorithms for complementarity problems and generalized equations , 1996 .

[7]  H. Simon,et al.  The sciences of the artificial (3rd ed.) , 1996 .

[8]  O. Nelles,et al.  An Introduction to Optimization , 1996, IEEE Antennas and Propagation Magazine.

[9]  A. Iusem,et al.  Enlargement of Monotone Operators with Applications to Variational Inequalities , 1997 .

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

[11]  Steven H. Low,et al.  Optimization flow control—I: basic algorithm and convergence , 1999, TNET.

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

[13]  M. Patriksson Nonlinear Programming and Variational Inequality Problems , 1999 .

[14]  Michael C. Ferris,et al.  Interfaces to PATH 3.0: Design, Implementation and Usage , 1999, Comput. Optim. Appl..

[15]  M. Ferris,et al.  Complementarity problems in GAMS and the PATH solver 1 This material is based on research supported , 2000 .

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

[17]  Frank Kelly,et al.  Mathematical Modelling of the Internet , 2001 .

[18]  T. Basar,et al.  A game-theoretic framework for congestion control in general topology networks , 2002, Proceedings of the 41st IEEE Conference on Decision and Control, 2002..

[19]  Jorge J. Moré,et al.  Digital Object Identifier (DOI) 10.1007/s101070100263 , 2001 .

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

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

[22]  Rayadurgam Srikant,et al.  The Mathematics of Internet Congestion Control , 2003 .

[23]  F. Facchinei,et al.  Finite-Dimensional Variational Inequalities and Complementarity Problems , 2003 .

[24]  Arkadi Nemirovski,et al.  Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems , 2004, SIAM J. Optim..

[25]  L. Pavel,et al.  OSNR optimization in optical networks: extension for capacity constraints , 2005, Proceedings of the 2005, American Control Conference, 2005..

[26]  Tansu Alpcan,et al.  Distributed Algorithms for Nash Equilibria of Flow Control Games , 2005 .

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

[28]  Elisabetta Allevi,et al.  The Proximal Point Method for Nonmonotone Variational Inequalities , 2006, Math. Methods Oper. Res..

[29]  Yurii Nesterov,et al.  Dual extrapolation and its applications to solving variational inequalities and related problems , 2003, Math. Program..

[30]  M. K. Jensen Aggregative games and best-reply potentials , 2010 .

[31]  Uday V. Shanbhag,et al.  Distributed iterative regularization algorithms for monotone Nash games , 2010, 49th IEEE Conference on Decision and Control (CDC).

[32]  I. Konnov Equilibrium Models and Variational Inequalities , 2013 .