Efficient Algorithm for Approximating Nash Equilibrium of Distributed Aggregative Games

In this paper, we aim to design a distributed approximate algorithm for seeking Nash equilibria of an aggregative game. Due to the local set constraints of each player, projectionbased algorithms have been widely employed for solving such problems actually. Since it may be quite hard to get the exact projection in practice, we utilize inscribed polyhedrons to approximate local set constraints, which yields a related approximate game model. We first prove that the Nash equilibrium of the approximate game is the ǫ-Nash equilibrium of the original game, and then propose a distributed algorithm to seek the ǫNash equilibrium, where the projection is then of a standard form in quadratic programming. With the help of the existing developed methods for solving quadratic programming, we show the convergence of the proposed algorithm, and also discuss the computational cost issue related to the approximation. Furthermore, based on the exponential convergence of the algorithm, we estimate the approximation accuracy related to ǫ. Additionally, we investigate the computational cost saved by approximation on numerical examples.

[1]  Yurii Nesterov,et al.  Interior-point polynomial algorithms in convex programming , 1994, Siam studies in applied mathematics.

[2]  V. N. Bogaevski,et al.  Matrix Perturbation Theory , 1991 .

[3]  Lacra Pavel,et al.  Asynchronous Distributed Algorithms for Seeking Generalized Nash Equilibria Under Full and Partial-Decision Information , 2018, IEEE Transactions on Cybernetics.

[4]  Li Qiu,et al.  Unitarily Invariant Metrics on the Grassmann Space , 2005, SIAM J. Matrix Anal. Appl..

[5]  Paul H. Calamai,et al.  Projected gradient methods for linearly constrained problems , 1987, Math. Program..

[6]  V. Bushenkov.  An iteration method of constructing orthogonal projections of convex polyhedral ets , 1986 .

[7]  Bahman Gharesifard,et al.  Price-Based Coordinated Aggregation of Networked Distributed Energy Resources , 2016, IEEE Transactions on Automatic Control.

[8]  Sergio Grammatico,et al.  Distributed Generalized Nash Equilibrium Seeking in Aggregative Games on Time-Varying Networks , 2019, IEEE Transactions on Automatic Control.

[9]  Maojiao Ye,et al.  Game Design and Analysis for Price-Based Demand Response: An Aggregate Game Approach , 2015, IEEE Transactions on Cybernetics.

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

[11]  E. Bronshtein.  ε-Entropy of convex sets and functions , 1976 .

[12]  Ashish Cherukuri,et al.  Initialization-free distributed coordination for economic dispatch under varying loads and generator commitment , 2014, Autom..

[13]  Y. Ye.  A new complexity result on minimization of a quadratic function with a sphere constraint , 1992 .

[14]  Long Wang,et al.  Distributed Algorithms for Searching Generalized Nash Equilibrium of Noncooperative Games , 2019, IEEE Transactions on Cybernetics.

[15]  Michel Dhome,et al.  Hyperplane Approximation for Template Matching , 2002, IEEE Trans. Pattern Anal. Mach. Intell..

[16]  R. Dudley.  Metric Entropy of Some Classes of Sets with Differentiable Boundaries , 1974 .

[17]  S. Vavasis.  Nonlinear optimization: complexity issues , 1991 .

[18]  M. Fortin,et al.  Augmented Lagrangian methods : applications to the numerical solution of boundary-value problems , 1983 .

[19]  Shu Liang,et al.  Distributed Nash Equilibrium Seeking for Aggregative Games With Nonlinear Dynamics Under External Disturbances , 2020, IEEE Transactions on Cybernetics.

[20]  Renato D. C. Monteiro,et al.  Interior path following primal-dual algorithms. part II: Convex quadratic programming , 1989, Math. Program..

[21]  E. Bronstein.  Approximation of convex sets by polytopes , 2008 .

[22]  H. Markowitz.  The optimization of a quadratic function subject to linear constraints , 1956 .

[23]  Yiguang Hong,et al.  Distributed Nash equilibrium seeking for aggregative games via a small-gain approach , 2019 .

[24]  Angelia Nedic,et al.  Distributed Algorithms for Aggregative Games on Graphs , 2016, Oper. Res..

[25]  Francesco Bullo,et al.  Distributed Control of Robotic Networks , 2009 .

[26]  Volker Nocke,et al.  Multiproduct-Firm Oligopoly: An Aggregative Games Approach , 2016 .

[27]  Sergio Grammatico,et al.  Distributed averaging integral Nash equilibrium seeking on networks , 2018, Autom..

[28]  Karl Henrik Johansson,et al.  Approximate Projected Consensus for Convex Intersection Computation: Convergence Analysis and Critical Error Angle , 2014, IEEE Transactions on Automatic Control.

[29]  Zhenhua Deng,et al.  Distributed Generalized Nash Equilibrium Seeking Algorithm Design for Aggregative Games Over Weight-Balanced Digraphs , 2019, IEEE Transactions on Neural Networks and Learning Systems.

[30]  Shu Liang,et al.  Distributed sub-optimal resource allocation via a projected form of singular perturbation , 2019, Autom..

[31]  Yutao Tang,et al.  Distributed Optimal Steady-State Regulation for High-Order Multiagent Systems With External Disturbances , 2019, IEEE Transactions on Systems, Man, and Cybernetics: Systems.

[32]  Lacra Pavel,et al.  An operator splitting approach for distributed generalized Nash equilibria computation , 2019, Autom..

[33]  Yifan Li,et al.  Hyperplane-Approximation-Based Method for Many-Objective Optimization Problems with Redundant Objectives , 2019, Evolutionary Computation.

[34]  Paul T. Boggs,et al.  Sequential Quadratic Programming , 1995, Acta Numerica.

[35]  Chen Hu,et al.  Distributed Algorithm Design for Nonsmooth Resource Allocation Problems , 2020, IEEE Transactions on Cybernetics.

[36]  Yiguang Hong,et al.  Distributed algorithm for ε-generalized Nash equilibria with uncertain coupled constraints , 2021, Autom..

[37]  Jie Chen,et al.  Distributed Computation of Nash Equilibria for Monotone Aggregative Games via Iterative Regularization , 2020, 2020 59th IEEE Conference on Decision and Control (CDC).

[38]  Shu Liang,et al.  Distributed Nash equilibrium seeking for aggregative games with coupled constraints , 2016, Autom..

[39]  Pascal Vincent,et al.  K-Local Hyperplane and Convex Distance Nearest Neighbor Algorithms , 2001, NIPS.

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

[41]  B. Hall.  Lie Groups, Lie Algebras, and Representations , 2003 .

[42]  Basilio Gentile,et al.  A Distributed Algorithm For Almost-Nash Equilibria of Average Aggregative Games With Coupling Constraints , 2020, IEEE Transactions on Control of Network Systems.