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 the theoretical foundations of computer systems (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 behaviors. In artificial intelligence, games allow us to formalize problems of dynamic motion policy synthesis. In their multiplayer form, games offer a suitable vocabulary for modeling complex multiagent systems and reasoning about them. For all these reasons, games in their many forms play a central role in 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 multiagent systems.

If you require special accommodation, please contact our access coordinator at simonsevents [at] berkeley.edu with as much advance notice as possible.

Invited Participants

Guillermo Alberto Perez (University of Antwerp), Christel Baier (Technische Universität Dresden), Davide Bresolin (University of Padova), Yu-Fang Chen (Institute of Information Science, Academia Sinica), Laurent Doyen (CNRS), Marco Faella (University of Naples Federico II), Dana Fisman (Ben-Gurion University), Guillermo Alberto Perez (University of Antwerp), Maria Polukarov (King's College London), Jean-François Raskin (Université Libre de Bruxelles)