Risk-Sensitive Linear-Quadratic-Gaussian Graphon Mean-Field Games

This paper investigates a class of linear-quadratic-Gaussian risk-sensitive graphon mean-field games, involving an asymptotically infinite population of heterogeneous agents distributed across an asymptotically infinite network, where each agent aims to minimize an exponential cost functional reflecting its risk sensitivity. Following the Nash certainty equivalence methodology, an auxiliary risk-sensitive optimal control problem is constructed and further combined with a consistency condition to determine decentralized strategies of the agents. The well-posedness of the resulting graphon mean-field game equation system, consisting of a family of fully coupled forward-backward differential equations, is established by a fixed point approach under a contraction condition, and by the method of continuity under an operator monotonicity condition, respectively. To prove the [Formula: see text]-Nash equilibrium property of the obtained decentralized strategies, one faces significant challenge since the usual [Formula: see text] error estimates on mean-field approximations are no longer adequate due to unboundedness of the integrand in the exponentiated cost. The proof will be accomplished by establishing certain exponentiated error estimates instead of [Formula: see text] error estimates. Finally, a numerical example is provided to illustrate our results.

Authors

Institutions

Publication Details

Journal
SIAM Journal on Control and Optimization
Published
2026-11-19
DOI
https://doi.org/10.1137/25m179169x
Primary Topic
Stochastic processes and financial applications
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Risk-Sensitive Linear-Quadratic-Gaussian Graphon Mean-Field Games

Tian Chen, Minyi Huang
2 links
SIAM Journal on Control and Optimization
Stochastic processes and financial applications
article

Risk-Sensitive Linear-Quadratic-Gaussian Graphon Mean-Field Games

Tian Chen, Minyi Huang
article en

Abstract

This paper investigates a class of linear-quadratic-Gaussian risk-sensitive graphon mean-field games, involving an asymptotically infinite population of heterogeneous agents distributed across an asymptotically infinite network, where each agent aims to minimize an exponential cost functional reflecting its risk sensitivity. Following the Nash certainty equivalence methodology, an auxiliary risk-sensitive optimal control problem is constructed and further combined with a consistency condition to determine decentralized strategies of the agents. The well-posedness of the resulting graphon mean-field game equation system, consisting of a family of fully coupled forward-backward differential equations, is established by a fixed point approach under a contraction condition, and by the method of continuity under an operator monotonicity condition, respectively. To prove the [Formula: see text]-Nash equilibrium property of the obtained decentralized strategies, one faces significant challenge since the usual [Formula: see text] error estimates on mean-field approximations are no longer adequate due to unboundedness of the integrand in the exponentiated cost. The proof will be accomplished by establishing certain exponentiated error estimates instead of [Formula: see text] error estimates. Finally, a numerical example is provided to illustrate our results.

SIAM Journal on Control and OptimizationVol. 64(6)
Carleton University (CA)
National Natural Science Foundation of China, Natural Sciences and Engineering Research Council of Canada
Stochastic processes and financial applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon