Searcharxiv⌕ Search

arXiv subjects

Sichen Qian

Publications and source records attributed to Sichen Qian.

2 recordsLinked to original sources
arXiv2024

Fully Distributed Adaptive Nash Equilibrium Seeking Algorithm for Constrained Noncooperative Games with Prescribed Performance

This paper investigates a fully distributed adaptive Nash equilibrium (NE) seeking algorithm for constrained noncooperative games with prescribed-time stability. On the one hand, prescribed-time stability for the proposed NE seeking algorithm is obtained by using an adaptive penalty technique, a time-varying control gain and a cosine-related time conversion function, which extends the prior asymptotic stability result. On the other hand, uncoordinated integral adaptive gains are incorporated in order to achieve the fully distribution of the algorithm. Finally, the theoretical result is validated through a numerical simulation based on a standard power market scenario.

math.OC↗
arXiv2024

Continuous-Time Distributed Seeking for Variational Generalized Nash Equilibrium of Online Game

This paper mainly investigates a class of distributed Variational Generalized Nash Equilibrium (VGNE) seeking problems for both online noncooperative games and online aggregative games with time-varying coupling inequality constraints. Two novel continuous-time distributed VGNE seeking algorithms are proposed, which realize the constant regret bound and sublinear fit bound, superior to those of the criteria for online optimization problems and online games. Furthermore, to reduce unnecessary communication among players, a dynamic event-triggered mechanism involving internal variables is introduced into the distributed VGNE seeking algorithm, while the constant regret bound and sublinear fit bound are still maintained. Also, the Zeno behavior is strictly prohibited. Moreover, we further investigate the impact of communication noise on the player's measurement of its neighbors' relative states. It is demonstrated that both the regret and fit bounds remain valid as long as the noise level is not excessively large. This result reveals, to some extent, the proposed algorithm's noise-resilient capability. Finally, an online Uncrewed Aerial Vehicle (UAV) swarm game and an online Nash-Cournot game are given to demonstrate the validity of the theoretical results.

math.OC↗