Saved in:
Bibliographic Details
Main Authors: Chen, Jianing, Qian, Sichen, Dang, Chuangyin, Qin, Sitian
Format: Preprint
Published: 2024
Subjects:
Online Access:https://arxiv.org/abs/2409.04765
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866915929995083776
author Chen, Jianing
Qian, Sichen
Dang, Chuangyin
Qin, Sitian
author_facet Chen, Jianing
Qian, Sichen
Dang, Chuangyin
Qin, Sitian
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2409_04765
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Continuous-Time Distributed Seeking for Variational Generalized Nash Equilibrium of Online Game
Chen, Jianing
Qian, Sichen
Dang, Chuangyin
Qin, Sitian
Optimization and Control
Systems and Control
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.
title Continuous-Time Distributed Seeking for Variational Generalized Nash Equilibrium of Online Game
topic Optimization and Control
Systems and Control
url https://arxiv.org/abs/2409.04765