Search problems, decentralized distributed control, and game theory

May 20th, 2016

Bastien Chopard

Dr Pierre Leone, University of Geneva

Laurent Lefèvre, ING-Grenoble (France)

Steve Alpern, Warwick Business School / London School of Economics (United Kingdom)

Ce séminaire donnera une introduction à deux sujets différents, mais ayant des liens importants dans le cadre des systèmes complexes et multi-agents. Ils ont notamment des liens à travers la théorie des jeux

• Rendez-vous and search problems
• Decentralized and distributed control of complex systems

The first part of the seminar will cover some aspect of the Theory of Rendezvous Games, from the definition of the problem and the various variants, in particular the different topology on which the game can be played. Applications of the Theory will be discussed. The second part of the seminar will focus on some recent aspects of control theory specifically dedicated to complex dynamical systems. At first these complex dynamical systems on their topological interconnection structures (graphs) will be defined. Then some of their structural system theoretic properties, such as stability, observability or controllability will be investigated. The feedback idea for state estimation and control algorithms will be introduced, with some examples using graphs algorithms. Finally, we will go through model based predictive optimal control (MPC), and specifically trough decentralized and distributed algorithms (DMPC), to make connections with game theory.

Link: cui.unige.ch/~chopard/CUSO/seminarMay20.2016.html

University of Geneva, Campus de Battelle, Carouge, room 404-406

10:00 - 12:30: Prof. Laurent Lefèvre, ING-Grenoble (France)

14:00 - 16:30: Prof. Steve Alpern, Warwick Business School / London School of Economics (United Kingdom)

20