Organizers: Rajeev Alur (Rice University), Pavol Cerný (University of Colorado Boulder), Rupak Majumdar (MPI), Michael Wooldridge (University of Oxford)
This workshop aims to develop game theory in connection with the verification, design, and analysis of complex systems.
Games have been developed since the beginning of TFCS: games permit the modeling of the complex logical interactions between a proponent and an opponent, a controller and an environment, or a verifier and a falsifier. Since this antagonistic nature of players underlies many concepts in TFCS, it naturally plays a central role in many applications, such as model checking and controller synthesis techniques, as well as in logics and automata theory. Games involving probabilistic features are also heavily studied in the analysis of realistic systems exhibiting stochastic behaviours. In artificial intelligence, games allow us to formalize problems of dynamic motion policy synthesis. In their multi-player form, games offer a suitable vocabulary for modeling complex multi-agent systems and reasoning about them. For all these reasons games, in their many forms play a central role TFCS.
This workshop will gather leading experts in these very active fields, ranging from theoretical aspects of game theory, involving algorithms for their exact resolutions and heuristics, to their applications in verification, in synthesis, in artificial intelligence and for multi-agent systems.
All events take place in the Calvin Lab auditorium.
Further details about this workshop will be posted in due course. Enquiries may be sent to the organizers tfcs2021 [at] lists [dot] simons [dot] berkeley [dot] edu (at this address).