BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//132.216.98.100//NONSGML kigkonsult.se iCalcreator 2.20.4//
BEGIN:VEVENT
UID:20260625T010151EDT-7674hA3S2L@132.216.98.100
DTSTAMP:20260625T050151Z
DESCRIPTION:Virtual Informal Systems Seminar (VISS) Centre for Intelligent 
 Machines (CIM) and Groupe d'Etudes et de Recherche en Analyse des Decision
 s (GERAD)\n\nZoom Link\n	Meeting ID: 910 7928 6959 Passcode: VISS\n\nSpeake
 r: Shuang Gao\, Postdoc Researcher\, Electrical and Computer Engineering\,
  ɬÀï·¬\n	\n	Abstract:\n	Graphon control (CDC 17-18-19\, IEEE TAC 
 20\, Gao and Caines) and graphon mean field games (CDC18\, CDC19\, Caines 
 and Huang) were used to address decision problems on very large-scale netw
 orks by employing graphons to represent arbitrary size graphs\, from\, res
 pectively centralized and decentralized perspectives. Graphon couplings ma
 y appear in states\, controls and cost\, and may be represented by differe
 nt graphons in each case. In this talk\, I will first briefly introduce gr
 aphon theory. Then I will present the use of subspace decompositions in gr
 aphon control and graphon mean field games in a linear quadratic setting. 
 The complexity of the methods corresponds to that of the solution of one n
 d × nd dimensional Riccati equation and one n × n Riccati equation\, where
  n is the dimension of each nodal agent state and d is the dimension of th
 e (nontrivial) invariant subspace shared by the coupling operators. Applic
 ations to the regulation of harmonic oscillators coupled over networks wit
 h uncertainties will be demonstrated (IEEE TCNS (Submitted)\, Gao and Cain
 es).\n
DTSTART:20201211T160000Z
DTEND:20201211T170000Z
LOCATION:CA\, ZOOM
SUMMARY:Subspace Decompositions in Graphon Control and Graphon Mean Field G
 ames
URL:/cim/channels/event/subspace-decompositions-grapho
 n-control-and-graphon-mean-field-games-326764
END:VEVENT
END:VCALENDAR