Games on Graphs
Games are a very elegant way of modelling systems where there are components not under our control. We will discuss games that are played on graphs by 2 players. One of the players will model well behaved parts of the system that are under out control (Elster) and the other player models the environment (Adler).
Game
The Gameplay for Games on Graphs is defined here.
Transclude of Game.excalidraw
Notes
- Basics ^68e6da
- Strategy for Games on Graphs
- Sub-Games
- Properties of the Attractor function and Traps
- sigma-paradise
- Banach-Mazur Games
GOG Course Stuff
- Church Synthesis Problem
- Büchi-McNaughton Theorem
- Look at Basics and Strategy for Games on Graphs.
- Winning Arena for Reachability Games
- Winning Arena for Büchi Games
- Letter Number Game
- Muller Games to Parity Games
- Progress Measures (Intuition)
- Parity Progress Measures on Graphs
- Parity Progress Measures on Games
- Zeilonka’s Algorithm for finding Parity Game Strategy
- Parity Games are solvable in Qusaipolynomial time - introduction
- Mean Payoff Games