An online algorithm for zero-sum LQ games with unknown dynamics combines model estimation and surrogate selection to achieve regret bounds on policy convergence.
Distributed nash equilib- rium seeking in games with partial decision information: A survey
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
eess.SY 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
An Online Learning Approach for Two-Player Zero-Sum Linear Quadratic Games
An online algorithm for zero-sum LQ games with unknown dynamics combines model estimation and surrogate selection to achieve regret bounds on policy convergence.