Continuous-Time Online Distributed Seeking for Generalized Nash Equilibrium of Nonmonotone Online Game
<|reference_start|>Continuous-Time Online Distributed Seeking for Generalized Nash Equilibrium of Nonmonotone Online Game: This paper mainly investigates a class of distributed generalized Nash equilibrium (GNE) seeking problems for online nonmonotone game with time-varying coupling inequality constraints. Based on a time-varying control gain, a novel continuous-time distributed GNE seeking algorithm is proposed, which realizes the constant regret bound and sublinear fit bound, matching those of the criteria for online optimization problems. Furthermore, to reduce unnecessary communication among players, a dynamic event-triggered mechanism involving internal variables is introduced into the distributed GNE seeking algorithm, while the constant regret bound and sublinear fit bound are still achieved. Also, the Zeno behavior is strictly prohibited. Finally, a numerical example is given to demonstrate the validity of the theoretical results.<|reference_end|>
@article{chen2024continuous-time,
    title={Continuous-Time Online Distributed Seeking for Generalized Nash
  Equilibrium of Nonmonotone Online Game},
    author={Jianing Chen, Sichen Qian, Chuangyin Dang, Sitian Qin},
    journal={arXiv preprint arXiv:2409.04765},
    year={2024},
    archivePrefix={arXiv},
    eprint={2409.04765},
    primaryClass={math.OC cs.SY eess.SY}
}