Time-Varying Momentum-Like Neurodynamic Optimization Approaches With Fixed-Time Convergence for Nash Equilibrium Seeking in Noncooperative Games

In this article, several novel time-varying momentum-like neurodynamic optimization approaches are proposed for Nash equilibrium (NE) seeking of noncooperative games. It is shown that the dynamics trajectories converge to NE within fixed-time from arbitrary initial conditions, achieving a quicker convergence rate through the selection of distinct time-varying coefficients. Moreover, the upper bounds of the settling time for the proposed NE seeking neurodynamic approaches are explicitly provided. In addition, the study investigates the robustness of the designed neurodynamic approaches in the presence of bounded noises. The superior convergence properties and practicability of our approaches are demonstrated through a simulation example involving energy consumption games.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Systems Man and Cybernetics Systems
Published
2025-03-24
DOI
https://doi.org/10.1109/tsmc.2025.3547407
Citations
2
Primary Topic
Adaptive Dynamic Programming Control
Type
article
Field-Weighted Citation Impact
3.01

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Time-Varying Momentum-Like Neurodynamic Optimization Approaches With Fixed-Time Convergence for Nash Equilibrium Seeking in Noncooperative Games

Xinsong Yang, Chuandong Li, Xingxing Ju
2 citations
IEEE Transactions on Systems Man and Cybernetics Systems
Adaptive Dynamic Programming Control
3.01
article

Time-Varying Momentum-Like Neurodynamic Optimization Approaches With Fixed-Time Convergence for Nash Equilibrium Seeking in Noncooperative Games

Xinsong Yang, Chuandong Li, Xingxing Ju
article en
2 citations

Abstract

In this article, several novel time-varying momentum-like neurodynamic optimization approaches are proposed for Nash equilibrium (NE) seeking of noncooperative games. It is shown that the dynamics trajectories converge to NE within fixed-time from arbitrary initial conditions, achieving a quicker convergence rate through the selection of distinct time-varying coefficients. Moreover, the upper bounds of the settling time for the proposed NE seeking neurodynamic approaches are explicitly provided. In addition, the study investigates the robustness of the designed neurodynamic approaches in the presence of bounded noises. The superior convergence properties and practicability of our approaches are demonstrated through a simulation example involving energy consumption games.

IEEE Transactions on Systems Man and Cybernetics SystemsVol. 55(6)
Southwest University (CN), Sichuan University (CN), Chengdu University of Information Technology (CN)
National Natural Science Foundation of China, China Postdoctoral Science Foundation
Reduced inequalities
Openalex Percentile: Top 10%
Adaptive Dynamic Programming Control
3.01
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Time-Varying Momentum-Like Neurodynamic Optimization Approaches With Fixed-Time Convergence for Nash Equilibrium Seeking in Noncooperative Games — Xinsong Yang, Chuandong Li, et al. · IEEE Transactions on Systems Man and Cybernetics Systems (2025) | TGRS Research Map | TGRS