quotation:[Copy]
[Copy]
【Print page】 【Online reading】【Download 【PDF Full text】 View/Add CommentDownload reader Close

←Previous page|Page Next →

Back Issue    Advanced search

This Paper:Browse 27   Download 12 本文二维码信息
码上扫一扫!
New directions in distributed Nash equilibrium seeking based on monotone operator theory
PengYI,TongyuWANG
0
(Department of Control Science & Engineering, Tongji University, Shanghai 201804, China; Shanghai Institute of Intelligent Science and Technology, Tongji University, Shanghai 201804, China)
摘要:
There has been an increasing research interest in modeling, optimization and control of various multi-agent networks that have wide applications in industry, defense, security, and social areas, such as computing clusters, interconnected micro-grid systems, unmanned vessel swarms \cite{ChenJie}, power systems\cite{MeiS}, multiple UAV systems\cite{KolaricP} and sensor networks\cite{LiuR}. For non-cooperative agents that only concern selfish profit-maximizing, the decision making problem can be modelled and solved with the help of game theory, while Nash equilibrium (NE) seeking is at the core to solve the non-cooperative multi-agent games \cite{HenrikSandberg, IsraelAlvarez, Jong-ShiPang}. Distributed NE seeking methods are appealing compared with the center-based methods in large-scale networks due to its scalability, privacy protection, and adaptability. Recently, monotone operator theory is explored for distributed NE seeking, which is shown to provide an uniform framework for various algorithms in different scenarios. It has been gradually developing into a cutting-edge research field, with the prospect and necessity of future in-depth research. In non-cooperative multi-agent games, each agent has different characteristics and pursues maximizing its own benefit. Hence, there is no centralized manager that can force all agents to adopt specified strategies to optimize the overall benefits. Under the NE, no player can decrease its cost by unilaterally changing its local decision to another feasible one. To seek an NE, the agent is required to optimize its own objective function given the opponent's countermeasures. Therefore, various optimization-based methods have been investigated for distributed NE seeking, such as the gradient flow method and the best response method....
关键词:  
DOI:https://doi.org/10.1007/s11768-020-0109-z
基金项目:This work was supported by the Shanghai Sailing Program (No. 20YF1453000) and the Fundamental Research Funds for the Central Universities (No. 22120200048).
New directions in distributed Nash equilibrium seeking based on monotone operator theory
Peng YI,Tongyu WANG
(Department of Control Science & Engineering, Tongji University, Shanghai 201804, China; Shanghai Institute of Intelligent Science and Technology, Tongji University, Shanghai 201804, China)
Abstract:
There has been an increasing research interest in modeling, optimization and control of various multi-agent networks that have wide applications in industry, defense, security, and social areas, such as computing clusters, interconnected micro-grid systems, unmanned vessel swarms \cite{ChenJie}, power systems\cite{MeiS}, multiple UAV systems\cite{KolaricP} and sensor networks\cite{LiuR}. For non-cooperative agents that only concern selfish profit-maximizing, the decision making problem can be modelled and solved with the help of game theory, while Nash equilibrium (NE) seeking is at the core to solve the non-cooperative multi-agent games \cite{HenrikSandberg, IsraelAlvarez, Jong-ShiPang}. Distributed NE seeking methods are appealing compared with the center-based methods in large-scale networks due to its scalability, privacy protection, and adaptability. Recently, monotone operator theory is explored for distributed NE seeking, which is shown to provide an uniform framework for various algorithms in different scenarios. It has been gradually developing into a cutting-edge research field, with the prospect and necessity of future in-depth research. In non-cooperative multi-agent games, each agent has different characteristics and pursues maximizing its own benefit. Hence, there is no centralized manager that can force all agents to adopt specified strategies to optimize the overall benefits. Under the NE, no player can decrease its cost by unilaterally changing its local decision to another feasible one. To seek an NE, the agent is required to optimize its own objective function given the opponent's countermeasures. Therefore, various optimization-based methods have been investigated for distributed NE seeking, such as the gradient flow method and the best response method....
Key words: