Please use this identifier to cite or link to this item: https://hdl.handle.net/10419/330081 
Year of Publication: 
2024
Citation: 
[Journal:] Games [ISSN:] 2073-4336 [Volume:] 15 [Issue:] 2 [Article No.:] 12 [Year:] 2024 [Pages:] 1-12
Publisher: 
MDPI, Basel
Abstract: 
Mean-field games (MFGs) are developed to model the decision-making processes of a large number of interacting agents in multi-agent systems. This paper studies mean-field games on graphs (𝒢-MFGs). The equilibria of 𝒢-MFGs, namely, mean-field equilibria (MFE), are challenging to solve for their high-dimensional action space because each agent has to make decisions when they are at junction nodes or on edges. Furthermore, when the initial population state varies on graphs, we have to recompute MFE, which could be computationally challenging and memory-demanding. To improve the scalability and avoid repeatedly solving 𝒢-MFGs every time their initial state changes, this paper proposes physics-informed graph neural operators (PIGNO). The PIGNO utilizes a graph neural operator to generate population dynamics, given initial population distributions. To better train the neural operator, it leverages physics knowledge to propagate population state transitions on graphs. A learning algorithm is developed, and its performance is evaluated on autonomous driving games on road networks. Our results demonstrate that the PIGNO is scalable and generalizable when tested under unseen initial conditions.
Subjects: 
mean-field game
scalable learning
physics-informed neural operator
Persistent Identifier of the first edition: 
Creative Commons License: 
cc-by Logo
Document Type: 
Article
Appears in Collections:

Files in This Item:
File
Size





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.