scientific article; zbMATH DE number 7471700

MaRDI QIDQ5028465

Patricia Bouyer, Pierre Vandenhove, Mickael Randour, Youssouf Oualhadj, Stéphane Le Roux

Publication date: 9 February 2022

Full work available at URL: https://arxiv.org/abs/2001.03894

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

optimal strategiesfinite-memory determinacytwo-player games on graphs

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Related Items (1)

Playing Safe, Ten Years Later

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
• First-cycle games
• Exploring the boundary of half-positionality
• Positional strategies for mean payoff games
• Borel determinacy
• Infinite games on finitely coloured graphs with applications to automata on infinite trees
• Extending finite-memory determinacy to multi-player games
• Energy parity games
• Strategy synthesis for multi-dimensional quantitative objectives
• Looking at mean-payoff and total-payoff through windows
• Automata, languages, and programming. 42nd international colloquium, ICALP 2015, Kyoto, Japan, July 6--10, 2015. Proceedings. Part II
• Deciding Maxmin Reachability in Half-Blind Stochastic Games
• Finitary winning in ω-regular games
• Graph Games and Reactive Synthesis
• Trading Bounds for Memory in Games with Counters
• Fixed-Dimensional Energy Games are in Pseudo-Polynomial Time
• Pure Stationary Optimal Strategies in Markov Decision Processes
• Half-Positional Determinacy of Infinite Games
• The Complexity of Tree Automata and Logics of Programs
• Simple Strategies in Multi-Objective MDPs
• Mathematical Foundations of Computer Science 2004
• Generalized Parity Games
• Formal Methods for Components and Objects
• CONCUR 2005 – Concurrency Theory

This page was built for publication: