The complexity of stochastic Müller games
type: Item
instance of: scholarly article
title: The complexity of stochastic Müller games
zbMATH Open document ID: 1238.91022
author: Krishnendu Chatterjee
published in: Information and Computation
publication date: 2012-05-24T00:00:00Z
Mathematics Subject Classification ID: 91A15
Mathematics Subject Classification ID: 91A43
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 6038290
zbMATH Keywords: game theory
zbMATH Keywords: stochastic games
zbMATH Keywords: Müller objectives
zbMATH Keywords: \(\omega \)-regular objectives
MaRDI profile type: Publication
full work available at URL: j.ic.2011.11.004
OpenAlex ID: W2162705683
cites work: Solving Sequential Conditions by Finite-State Strategies
cites work: Concurrent games with tail objectives
cites work: Optimal Strategy Synthesis in Stochastic Müller Games
cites work: Stochastic Müller Games are PSPACE-Complete
cites work: Automata, Languages and Programming
cites work: Strategy Improvement and Randomized Subexponential Algorithms for Stochastic Parity Games
cites work: Computer Science Logic
cites work: Q5501249
cites work: The complexity of stochastic games
cites work: Q4287357
cites work: Q4038703
cites work: Q4382287
cites work: Dicing on the Streett
cites work: Random Fruits on the Zielonka Tree
cites work: Mathematical Foundations of Computer Science 2005
cites work: The determinacy of Blackwell games
cites work: Q4428307
cites work: Fixed point characterization of infinite behavior of finite-state systems
cites work: Algorithms for stochastic games ? A survey
cites work: Supervisory Control of a Class of Discrete Event Processes
cites work: Infinite games on finitely coloured graphs with applications to automata on infinite trees
cites work: Foundations of Software Science and Computation Structures
cites work: The complexity of mean payoff games on graphs
DOI: 10.1016/J.IC.2011.11.004
Recommended article: The complexity of stochastic games
Recommended article: Stochastic Müller Games are PSPACE-Complete
Recommended article: Automata, Languages and Programming
Recommended article: The Complexity of Solving Stochastic Games on Graphs
Recommended article: The Complexity of Ergodic Mean-payoff Games
Recommended article: The Complexity of Nash Equilibria in Stochastic Multiplayer Games
Recommended article: The complexity of mean payoff games
Recommended article: Optimal Strategy Synthesis in Stochastic Müller Games
Recommended article: The Complexity of Nash Equilibria in Simple Stochastic Multiplayer Games
description: scientific article; zbMATH DE number 6038290