Schedule

8:50-9:00 -- welcome
9:00-10:00
Benjamin Aminof, Marta Kwiatkowska, Bastien Maubert, Aniello Murano and Sasha Rubin
Probabilistic Strategy Logic
Bastien Maubert, Sophie Pinchinat and Francois Schwarzentruber
Reachability Games in Dynamic Epistemic Logic
10:00-10:30 -- coffee break
10:30-12:30
Blai Bonet, Giuseppe De Giacomo, Hector Geffner, Fabio Patrizi and Sasha Rubin
Program Synthesis through Generalized Planning
Tristan Charrier, Arthur Queffelec, Ocan Sankur and Francois Schwarzentruber
Reachability and Coverage Planning for Connected Agents: Extended Version
Guifei Jiang, Laurent Perrussel, Dongmo Zhang and Heng Zhang
Characterizing the Expressivity of Game Description Languages
Kaisheng Wu, Qiao Yong, Liangda Fang, Liping Xiong, Wenyong Gong, Zhao-Rong Lai, Qian Dong and Linfeng Wei
Automatic Synthesis of Generalized Winning Strategy of Impartial Combinatorial Games Using SMT Solvers
12:30-14:00 -- lunch
14:00-15:00
Gabriele Farina, Christian Kroer and Tuomas Sandholm
Optimistic Regret Minimization for Extensive-Form Games via Dilated Distance-Generating Functions
Gabriele Farina, Chun Kai Ling, Fei Fang and Tuomas Sandholm
Power of Correlation in Extensive-Form Games
15:00-16:00 Invited talk - Wojtek Jamroga - On Module Checking and Strategies
16:00-16:30 -- coffee break
16:30-17:30
Zheyuan Ryan Shi, Ariel D. Procaccia, Kevin S. Chan, Sridhar Venkatesan, Noam Ben-Asher, Nandi O. Leslie, Charles Kamhoua and Fei Fang
Feature Deception Games
Alberto Camacho, Meghyn Bienvenu and Sheila A. McIlraith
Finite LTL Synthesis with Environment Assumptions
17:30-18:00 -- discussions