The paper develops continuous-time distributed VGNE seeking algorithms for online games that achieve constant regret and sublinear fit bounds, with event-triggering and noise resilience.
Dynamic Nash equilibrium seeking for higher-order integrators in networks,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2024 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Continuous-Time Distributed Seeking for Variational Generalized Nash Equilibrium of Online Game
The paper develops continuous-time distributed VGNE seeking algorithms for online games that achieve constant regret and sublinear fit bounds, with event-triggering and noise resilience.