.png){kind=icon}
返回
Efficient Algorithm for Approximating Nash Equilibrium of Distributed Aggregative Games
.png){kind=icon}
OA
AI
DOI：10.1109/TCYB.2022.3175831.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this article, we aim to design a distributed approximate algorithm for seeking Nash equilibria (NE) of an aggregative game. Due to the local set constraints of each player, projection-based 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 NE of the approximate game is the epsilon -NE of the original game and then propose a distributed algorithm to seek the epsilon -NE, where the projection is then of a standard form in quadratic optimization with linear constraints. With the help of the existing developed methods for solving quadratic optimization, 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 epsilon . In addition, we investigate the computational cost saved by approximation in numerical simulation.
Keyword:
Games
Approximation algorithms
Heuristic algorithms
Optimization
Standards
Distributed algorithms
Convergence
-Nash equilibrium (NE)
aggregative game
approximation
distributed algorithm
期刊
IF:
10.5
论文数:
1.1W
被引数:
5.0W
机构
引用论文
Adaptive approaches for fully distributed Nash equilibrium seeking in networked games.png)
AUTOMATICA
OAAI
AUTOMATICAIF5.9
OAAI分享收藏分享收藏分享收藏Initialization-free distributed coordination for economic dispatch under varying loads and generator commitmentAUTOMATICAOAAI
AUTOMATICAIF5.9
OAAI分享收藏
查看更多内容