Critical Nash Value Nodes for Control Affine Embedded Graphon Mean Field Games

IFAC PAPERSONLINE(2023)

引用 0|浏览4
暂无评分
摘要
Graphon Mean Field Games (GMFGs) (Caines and Huang (2021)) constitute generalizations of Mean Field Games to the case where the agents form subpopulations associated with the nodes of large graphs. The work in (Foguen-Tchuendom et al. (2021), Foguen-Tchuendom et al. (2022a)) analyzed the stationarity of equilibrium Nash values with respect to node location for large populations of non-cooperative agents with linear dynamics on large graphs embedded in Euclidean space together with their limits (termed embedded graphons). That analysis is extended in this investigation to agent systems lying in the class of control affine non-linear systems (see Isidori (1985)). Specifically, control affine GMFG systems are treated where (i) at each node a is an element of V the drift of each generic agent system is affine in the control function, and (ii) the running costs at each node is an element of a V subset of R-m are exponentiated negative inverse quadratic (ENIQ) functions of the difference between a generic state and the local graphon weighted mean Z(a,mu G) where mu(G) {= mu(beta),beta is an element of V subset of R-m} is the globally distributed family of mean fields. The infinite cardinality node and edge limits are considered, where it is assumed that the limit embedded graphon g(a, beta), (a, beta) V x V, is continuously differentiable. It is shown that the equilibrium Nash value V a is stationary with respect to the nodal location a is an element of V if and only if the corresponding mean Z(a,mu G) is stationary with respect to nodal location. Copyright (c) 2023 The Authors.
更多
查看译文
关键词
Mean Field Games,Networks,Graphons
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要