Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 31 tok/s
Gemini 2.5 Pro 50 tok/s Pro
GPT-5 Medium 11 tok/s Pro
GPT-5 High 9 tok/s Pro
GPT-4o 77 tok/s Pro
Kimi K2 198 tok/s Pro
GPT OSS 120B 463 tok/s Pro
Claude Sonnet 4 36 tok/s Pro
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.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Lightbulb On Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)