SOME PROBLEMS IN OPTIMAL VISITING MEAN FIELD GAMES: CONTINUITY EQUATION WITH SINKS AND SWITCHING REPRESENTATION ON A NETWORK - FABIO BAGAGIOLO - UNIVERSITÁ DEGLI STUDI DI TRENTO
Abstract: An optimal visiting problem consists in touching some targets (regions of R^n) along the controlled trajectory, optimizing a suitable cost. The associated mean field game corresponds to the case where a huge population of agents perform the same optimal visiting problem and the costs also depend on the congestion. The population is then dynamically split into several populations labelled by the targets that have been already visited. There is therefore a transfer between the sub-populations and the continuity equation presents some sink-terms. The labels may also be interpreted as nodes of a direct network, giving a switching dynamics on it.
Tutti gli interessati sono invitati a partecipare.
Se siete interessati a partecipare in presenza mandate una mail a: email@example.com così da eventualmente evitare problemi di capienza dell’aula.