A distributed, event-triggered, model-free algorithm is proven to drive N-player quadratic games near the unique Nash equilibrium, with a guaranteed minimum time between communication events.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Distributed Event-Triggered Nash Equilibrium Seeking for Noncooperative Games
A distributed, event-triggered, model-free algorithm is proven to drive N-player quadratic games near the unique Nash equilibrium, with a guaranteed minimum time between communication events.