Stochastic window mean-payoff games

DOI10.1007/978-3-031-57228-9_3MaRDI QIDQ6629449

Shibashis Guha, Laurent Doyen, Pranshu Gaba

Publication date: 30 October 2024

zbMATH Keywords

stochastic gamesreactive synthesismean-payofffinitary objectives

Mathematics Subject Classification ID

Theory of computing (68Qxx) Theory of software (68Nxx)

Cites Work

• 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}\)
• A survey of stochastic \(\omega \)-regular games
• From liveness to promptness
• A low and a high hierarchy within NP
• Positional strategies for mean payoff games
• The complexity of stochastic games
• The complexity of mean payoff games on graphs
• Automata, logics, and infinite games. A guide to current research
• Looking at mean-payoff and total-payoff through windows
• Concurrent games with tail objectives
• Finitary winning in ω-regular games
• Stochastic Games with Finitary Objectives
• Optimal strategy synthesis for request-response games
• Value Iteration
• The determinacy of Blackwell games
• On the complexity of heterogeneous multidimensional quantitative games
• Faster Algorithms for Finitary Games
• Tools and Algorithms for the Construction and Analysis of Systems

This page was built for publication: Stochastic window mean-payoff games