Asynchronous Replanning in Two Population Linear Quadratic Mean Field Games: Information Requirements and Stability
This research investigates how two populations in a complex game coordinate their future plans when updates are asynchronous. The study proves that replanning only requires an aggregate state and the opponent's current plan to start, and shows a specific local rule successfully reproduces ideal outcomes. It establishes stability for these decentralized systems, even near infinite update rates, providing concrete bounds for finite populations.