CAALM 2025 (Complexity, Algorithms, Automata and Logic Meet)

9:30 - 10:20 (50min)

Permissive Equilibria in Multiplayer Reachability Games

Benjamin Monmege

10:30 - 11:00 (30min)

Coffee break

11:00 - 11:25 (25min)

The Multiplicative Weights Update Technique

Nabil Mustafa

11:30 - 11:55 (25min)

On the Probabilistic and Statistical Verification of Infinite Markov Chains

Patricia Bouyer-Decitre

12:00 - 13:30 (1h30)

Lunch

13:30 - 14:20 (50min)

On Dependent Outputs in Reactive Synthesis

Supratik Chakraborty

14:30 - 15:00 (30min)

Coffee break

15:00 - 15:25 (25min)

Stabilizer Limits and Orbit Closures in Geometric Complexity Theory

K.V. Subrahmanyam

15:30 - 15:55 (25min)

Decidable fragments of First Order Modal Logic

Anantha Padmanabha

16:00 - 17:00 (1h)

Coffee break

Program