Convex Analysis for LQG Systems with Applications to Major Minor LQG Mean-Field Game Systems
Not on the map. Why?
Abstract (arXiv)
We develop a convex analysis approach for solving LQG optimal control problems and apply it to major-minor (MM) LQG mean-field game (MFG) systems. The approach retrieves the best response strategies for the major agent and all minor agents that attain an ε-Nash equilibrium. An important and distinctive advantage to this approach is that unlike the classical approach in the literature, we are able to avoid imposing assumptions on the evolution of the mean-field. In particular, this provides a tool for dealing with complex and non-standard systems.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). First posted on arXiv 16 Oct 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 1.
2 papers.
- 2022Learning Sparse Graphon Mean Field Gamescited by 14
- 2021Deep Learning for Principal-Agent Mean Field Gamescited by 5
- 2022Learning Sparse Graphon Mean Field Games8 Sep 2022
- 2021Deep Learning for Principal-Agent Mean Field Games3 Oct 2021