Distributed Nash equilibrium seeking strategy with incomplete information

Yuwen, Cheng; Wang, Xiaowen; Liu, Shuai; Zhang, Xianfu; Sun, Bo

doi:10.1016/j.isatra.2022.01.022

Cited by 1 publication

(2 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…32 With incomplete information and random disturbances, each player uses a stochastic event-triggered method to search the NE. 33 For continue-time systems, the players update their actions with gradient and communicate with their neighbors by discrete-time protocols, which can reduce the communication rounds. 34 Subsequently, an event-triggered mechanism is designed to save the consumption of communication resource even further.…”

Section: Introductionmentioning

confidence: 99%

“…Subsequently, the result is extended to general NE seeking strategies 32 . With incomplete information and random disturbances, each player uses a stochastic event‐triggered method to search the NE 33 . For continue‐time systems, the players update their actions with gradient and communicate with their neighbors by discrete‐time protocols, which can reduce the communication rounds 34 .…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Distributed Nash equilibrium seeking strategies via bilateral bounded gradient approach

Yuwen

Zhen

Liu

2023

Intl J Robust & Nonlinear

Self Cite

View full text Add to dashboard Cite

This paper investigates distributed Nash equilibrium (NE) seeking problems.A bilateral bounded gradient approach, a novel optimization algorithm, is utilized to solve strongly convex problems. Furthermore, for a strongly monotone game, the NE can be obtained in finite time by the bilateral bounded gradient algorithm. In the distributed manner, two types of algorithms are proposed for seeking the NE: consensus-based strategy and passivity-based strategy. For each player, nonlinear protocols are proposed to estimate the actions of their rivals, enabling these estimations to converge to the actual actions in fixed time.To solve the optimization problem, the bilateral bounded gradient algorithm is employed, ensuring that all players' actions converge to the NE in finite time.Moreover, to reduce the communication consumption, event-triggered schemes are introduced in the information exchange of players. Finally, swarm roundup behavior is analyzed by a non-cooperative game in which the proposed algorithms drive all tanks to hunt the target in finite time. The roundup effectiveness is verified by the simulations.

show abstract

Section: Introductionmentioning

confidence: 99%