Characterizing positionality in games of infinite duration over infinite graphs
From MaRDI portal
Recommendations
- Characterizing positionality in games of Infinite duration over infinite graphs
- Mathematical Foundations of Computer Science 2004
- Admissible Strategies in Infinite Games over Graphs
- The Theory of Universal Graphs for Infinite Duration Games
- Positional Determinacy of Games with Infinitely Many Priorities
Cites work
- CONCUR 2005 – Concurrency Theory
- Extending Finite-Memory Determinacy by Boolean Combination of Winning Conditions
- Half-Positional Determinacy of Infinite Games
- scientific article; zbMATH DE number 3572126 (Why is no real title available?)
- scientific article; zbMATH DE number 7559480 (Why is no real title available?)
- Infinite games on finitely coloured graphs with applications to automata on infinite trees
- Infinite games played on finite graphs
- Infinite Runs in Weighted Timed Automata with Energy Constraints
- Interpolation of functions over a measure space and conjectures about memory
- Nash equilibria in games over graphs equipped with a communication mechanism
- On the positional determinacy of edge-labeled games
- Playing Safe
- Positional Determinacy of Games with Infinitely Many Priorities
- Solving Sequential Conditions by Finite-State Strategies
- Stochastic Games
- The Theory of Universal Graphs for Infinite Duration Games
Cited in
(2)
This page was built for publication: Characterizing positionality in games of infinite duration over infinite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6649452)
