Generalized Nash Equilibrium Problem by the Alternating Direction Method of Multipliers

In this paper, the problem of finding a generalized Nash equilibrium (GNE) of a networked game is studied. Players are only able to choose their decisions from a feasible action set. The feasible set is considered to be a private linear equality constraint that is coupled through decisions of the other players. We consider that each player has his own private constraint and it has not to be shared with the other players. This general case also embodies the one with shared constraints between players and it can be also simply extended to the case with inequality constraints. Since the players don't have access to other players' actions, they need to exchange estimates of others' actions and a local copy of the Lagrangian multiplier with their neighbors over a connected communication graph. We develop a relatively fast algorithm by reformulating the conservative GNE problem within the framework of inexact-ADMM. The convergence of the algorithm is guaranteed under a few mild assumptions on cost functions. Finally, the algorithm is simulated for a wireless ad-hoc network.

[1]  Stephen P. Boyd,et al.  Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers , 2011, Found. Trends Mach. Learn..

[2]  Francisco Facchinei,et al.  Generalized Nash Equilibrium Problems , 2010, Ann. Oper. Res..

[3]  Asuman E. Ozdaglar,et al.  Distributed Alternating Direction Method of Multipliers , 2012, 2012 IEEE 51st IEEE Conference on Decision and Control (CDC).

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

[5]  Prashant G. Mehta,et al.  Nash Equilibrium Problems With Scaled Congestion Costs and Shared Constraints , 2011, IEEE Transactions on Automatic Control.

[6]  Zhu Han,et al.  Game Theory in Wireless and Communication Networks: Theory, Models, and Applications , 2011 .

[7]  Bingsheng He,et al.  On the O(1/n) Convergence Rate of the Douglas-Rachford Alternating Direction Method , 2012, SIAM J. Numer. Anal..

[8]  Farzad Salehisadaghiani,et al.  Distributed Nash equilibrium seeking: A gossip-based algorithm , 2016, Autom..

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

[10]  Farzad Salehisadaghiani,et al.  Distributed Nash equilibrium seeking by gossip in games on graphs , 2016, 2016 IEEE 55th Conference on Decision and Control (CDC).

[11]  Björn Johansson,et al.  On Distributed Optimization in Networked Systems , 2008 .

[12]  Xiangfeng Wang,et al.  Multi-Agent Distributed Optimization via Inexact Consensus ADMM , 2014, IEEE Transactions on Signal Processing.

[13]  Francesca Parise,et al.  Network aggregative games: Distributed convergence to Nash equilibria , 2015, 2015 54th IEEE Conference on Decision and Control (CDC).

[14]  John N. Tsitsiklis,et al.  Parallel and distributed computation , 1989 .

[15]  Emilio Frazzoli,et al.  Distributed robust adaptive equilibrium computation for generalized convex games , 2015, Autom..

[16]  Francesca Parise,et al.  Distributed computation of generalized Nash equilibria in quadratic aggregative games with affine coupling constraints , 2016, 2016 IEEE 55th Conference on Decision and Control (CDC).

[17]  Sergio Grammatico,et al.  Aggregative control of competitive agents with coupled quadratic costs and shared constraints , 2016, 2016 IEEE 55th Conference on Decision and Control (CDC).

[18]  Farzad Salehisadaghiani,et al.  Distributed Nash Equilibrium Seeking via the Alternating Direction Method of Multipliers , 2016, ArXiv.

[19]  Andreas Fischer,et al.  GENERALIZED NASH EQUILIBRIUM PROBLEMS - RECENT ADVANCES AND CHALLENGES , 2014 .

[20]  Lacra Pavel,et al.  A distributed primal-dual algorithm for computation of generalized Nash equilibria with shared affine coupling constraints via operator splitting methods , 2017, ArXiv.

[21]  Jong-Shi Pang,et al.  On the solution of affine generalized Nash equilibrium problems with shared constraints by Lemke’s method , 2013, Math. Program..