Games 08 Meeting > Programme
Monday, 8 September
8:15-8:45 Coffee and registration
8:45-9:00 Opening
9:00-10:30 Tutorial
Jouko Väänänen (Amsterdam) Dependence Logic
10:30-11:00 Coffee break
11:00-12:30
11:00 Erich Grädel (Aachen)The Descriptive Complexity of Parity Games
11:30 Jan van Eijck (Amsterdam) Determined Game Logic is Complete
12:00 Loes Olde Loohuis (Amsterdam) Multi-Player Logic
12:15 Jarmo Kontinen (Amsterdam) On Computational Complexity of Disjunction in Dependence Logic
12:30-14:00 Lunch
14:00-15:30
14:00 Elisabetta de Maria (Udine) Games on strings with a limited ordering
14:30 Filip Murlak (Warszawa) Weak index versus Borel rank
15:00 Szczepan Hummel (Warszawa) On Borel Inseparability of Game Tree Languages
15:15 Chrysida Galanaki (Athens) Infinite-Game Semantics for Logic Programs with Negation
15:30-16:00 Coffee break
16:00-17:45
16:00 Mikołaj Bojańczyk (Warsaw) A Robust Extension of omega-Regular Languages.
16:30 Christof Löding (Aachen) The Non-Deterministic Mostowski Hierarchy and Distance-Parity Automata
17:00 Christopher Broadbent (Oxford) Higher Order Recursion Schemes with Order 0 Exceptions
17:15 Vassilis Kountouriotis (Athens) Boolean Grammars, Well-Founded Semantics and Parsing as an Infinite Game
17:30 Roman Rabinovich (Aachen) Directed Graphs of Entanglement Two
18:00 Reception (Kazmierzowski Palace)
Tuesday, 9 September
8:30-9:00 Coffee
9:00-10:30 Tutorial
Patricia Bouyer (Cachan) Quantitative Timed Games
10:30-11:00 Coffee break
11:00-12:00
11:00 Michał Rutkowski (Warwick) Hybrid average-price/reward games for controller synthesis
11:15 Vojtěch Forejt (Brno) The Satisfiability Problem for Probabilistic CTL
11:30 Ashutosh Trivedi (Warwick) Average-Time Games
11:45 Václav Brožek (Brno) Reachability in 2~1/2-player BPA games
12:00-13:30 Lunch
13:30-15:15
13:30 Dietmar Berwanger (Aachen) On the Succinct Expressiveness of Imperfect Information
14:00 Łukasz Kaiser (Aachen) Games Played with Graphs and Model Checking
14:30 Florian Horn (Aachen, Paris) A polynomial algorithm for explicit Muller games
14:45 Anca Muscholl (Bordeaux) Deciding properties of active documents
17:00-19:00 Game (Łazienki Park)
19:00- Dinner (Belvedere Restaurant)
Wednesday, 10 September
8:30-9:00 Coffee
9:00-10:30 Tutorial
Bernhard von Stengel (London) Mixed Equilibria in Two-Player Games
10:30-11:00 Coffee break
11:00-12:30
11:00 Krzysztof Apt (Amsterdam) Relative Strength of Strategy Elimination Procedures
11:30 Dov Samet (Tel Aviv) The sure-thing principle and independence of irrelevant knowledge
12:00 Jacek Miękisz (Warszawa) Equilibrium selection in stochastic evolutionary games
12:30-14:00 Lunch
14:00-15:30 Tutorial
Kousha Etessami (Edinburgh) The Complexity of Nash Equilibria and Fixed Points of Algebraic Functions
15:30-16:00 Coffee break
16:00-17:15
16:00 Dominik Wojtczak (Edinburgh) Quasi-Birth-Death Decision Processes (a.k.a., 1-Counter MDPs)
16:15 Michael Ummels (Aachen) The Complexity of Pure Nash Equilibria in Stochastic Multiplayer Games
16:30 Hugo Gimbert (Bordeaux) Do There Exist Optimal Strategies in Stochastic Games with Value 1?
17:00 Florian Horn (Aachen, Paris) How to compute the values of a prefix-independent game.
Thursday, 11 September
8:30-9:00 Coffee
9:00-10:30 Tutorial
Helmut Seidl (Munich) Precise Program Analysis, Strategy Improvement and Games
10:30-11:00 Coffee break
11:00-12:00
11:00 Jérôme Leroux (Bordeaux) An Easy Algorithm For The General Vector Addition System Reachability Problem.
11:30 Jonathan Cederberg (Uppsala) Monotonic Abstraction (Applications in Parameterized Verification and Shape Analysis)
12:00-13:30 Lunch
13:30-15:15
13:30 Blaise Genest (Rennes) Communicating Games and Quasi Static Scheduling
14:00 Anthony Widjaja To (Edinburgh) Recurrent Reachability in Regular Model Checking
14:15 Aniello Murano (Napoli) The Pushdown Module Checking Saga
14:45 Paweł Parys (Warsaw) XPath Evaluation in Linear Time
15:00 Clemens Ley (Oxford) A Note on the Expressive Power of Temporal Logics on Trees