An extremum seeking-based approach for Nash equilibrium seeking in N-cluster noncooperative games
This paper considers Nash equilibrium seeking for N-cluster noncooperative games in which the explicit expressions of the agents’ local objective functions are not available to the agents. As an alternative, the output values of the agents’ local objective functions are supposed to be measurable. An...
Saved in:
Main Authors: | Ye, Maojiao, Hu, Guoqiang, Xu, Shengyuan |
---|---|
Other Authors: | School of Electrical and Electronic Engineering |
Format: | Article |
Language: | English |
Published: |
2021
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/152097 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Nash equilibrium seeking for N-coalition noncooperative games
by: Ye, Maojiao, et al.
Published: (2020) -
Continuous-time penalty methods for Nash equilibrium seeking of a nonsmooth generalized noncooperative game
by: Sun, Chao, et al.
Published: (2022) -
Nash equilibrium seeking with prescribed performance
by: Sun, Chao, et al.
Published: (2024) -
Distributed Nash equilibrium seeking for multi-agent systems with uncertainty in the cost function
by: Ma, Chunhe, et al.
Published: (2024) -
Nash equilibrium seeking in N-coalition games via a gradient-free method
by: Pang, Yipeng, et al.
Published: (2022)