m

Documents  91A13 | enregistrements trouvés : 2

O
     

-A +A

P Q

Déposez votre fichier ici pour le déplacer vers cet enregistrement.

Very large networks linking dynamical agents are now ubiquitous and there is significant interest in their analysis, design and control. The emergence of the graphon theory of large networks and their infinite limits has recently enabled the formulation of a theory of the centralized control of dynamical systems distributed on asymptotically infinite networks [Gao and Caines, IEEE CDC 2017, 2018]. Furthermore, the study of the decentralized control of such systems has been initiated in [Caines and Huang, IEEE CDC 2018] where Graphon Mean Field Games (GMFG) and the GMFG equations are formulated for the analysis of non-cooperative dynamical games on unbounded networks. In this talk the GMFG framework will be first be presented followed by the basic existence and uniqueness results for the GMFG equations, together with an epsilon-Nash theorem relating the infinite population equilibria on infinite networks to that of finite population equilibria on finite networks. Very large networks linking dynamical agents are now ubiquitous and there is significant interest in their analysis, design and control. The emergence of the graphon theory of large networks and their infinite limits has recently enabled the formulation of a theory of the centralized control of dynamical systems distributed on asymptotically infinite networks [Gao and Caines, IEEE CDC 2017, 2018]. Furthermore, the study of the decentralized ...

91A13 ; 49N70 ; 93E20 ; 93E35

... Lire [+]

Déposez votre fichier ici pour le déplacer vers cet enregistrement.

Control Theory and Optimization

Mean field games (MFG) are dynamic games with infinitely many infinitesimal agents. In this joint work with Catherine Rainer (U. Brest), we study the efficiency of Nash MFG equilibria: Namely, we compare the social cost of a MFG equilibrium with the minimal cost a global planner can achieve. We find a structure condition on the game under which there exists efficient MFG equilibria and, in case this condition is not fulfilled, quantify how inefficient MFG equilibria are. Mean field games (MFG) are dynamic games with infinitely many infinitesimal agents. In this joint work with Catherine Rainer (U. Brest), we study the efficiency of Nash MFG equilibria: Namely, we compare the social cost of a MFG equilibrium with the minimal cost a global planner can achieve. We find a structure condition on the game under which there exists efficient MFG equilibria and, in case this condition is not fulfilled, quantify how ...

91A13 ; 35Q91

... Lire [+]

Z