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.
Distributed subgradient methods for convex optimization over random networks,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
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.