Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
153 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

LQG Mean Field Games with a Major Agent: Nash Certainty Equivalence versus Probabilistic Approach (2012.04866v3)

Published 9 Dec 2020 in math.OC, cs.SY, and eess.SY

Abstract: Mean field game (MFG) systems consisting of a major agent and a large number of minor agents were introduced in (Huang, 2010) in an LQG setup. The Nash certainty equivalence was used to obtain a Markovian closed-loop Nash equilibrium for the limiting system when the number of minor agents tends to infinity. In the past years several approaches to major--minor mean field game problems have been developed, principally (i) the Nash certainty equivalence and analytic approach, (ii) master equations, (iii) asymptotic solvability, and (iv) the probabilistic approach. For the LQG case, the recent work (Huang, 2021) establishes the equivalency of the Markovian closed-loop Nash equilibrium obtained via (i) with those obtained via (ii) and (iii). In this work, we demonstrate that the Markovian closed-loop Nash equilibrium of (i) is equivalent to that of (iv) for the LQG case. These two studies answer the long-standing questions about the consistency of the solutions to major-minor LQG MFG systems derived using different approaches.

Citations (6)

Summary

We haven't generated a summary for this paper yet.