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.
Distributed Nash equilibrium seeking by a consensus based approach,
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
math.OC 2verdicts
UNVERDICTED 2representative citing papers
Proposes robust NE seeking algorithms for second-order players with external disturbances using supertwisting-based ISMC and leader-follower consensus over semi-Markov switching topologies, with event-triggered sampling and mean-square stability proof via Lyapunov-Krasovskii functional.
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.
-
Robust Nash equilibrium seeking based on semi-Markov switching topologies
Proposes robust NE seeking algorithms for second-order players with external disturbances using supertwisting-based ISMC and leader-follower consensus over semi-Markov switching topologies, with event-triggered sampling and mean-square stability proof via Lyapunov-Krasovskii functional.