A survey of stochastic -regular games

DOI10.1016/J.JCSS.2011.05.002zbMATH Open1237.91036OpenAlexW2005684815MaRDI QIDQ414898FDOQ414898

Authors: Krishnendu Chatterjee, Thomas A. Henzinger 

Publication date: 11 May 2012

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2011.05.002

Recommendations

• scientific article; zbMATH DE number 1031404
• scientific article; zbMATH DE number 4102853
• A Survey of Stochastic Games with Limsup and Liminf Objectives
• Mean-payoff games with \(\omega\)-regular specifications
• Quantitative solution of \(\omega\)-regular games
• A survey of partial-observation stochastic parity games
• scientific article; zbMATH DE number 3989138
• Stochastic games for \(N\) players
• \((s,S)\) equilibria in stochastic games

zbMATH Keywords

game theorystochastic games\(\omega \)-regular objectives

Mathematics Subject Classification ID

2-person games (91A05) Stochastic games, stochastic differential games (91A15) Games involving graphs (91A43)

Cites Work

• The complexity of stochastic games
• The complexity of mean payoff games on graphs
• Equilibrium points in n -person games
• Stochastic Games
• Title not available (Why is that?)
• Alternating-time temporal logic
• The Complexity of Markov Decision Processes
• The complexity of probabilistic verification
• Title not available (Why is that?)
• Title not available (Why is that?)
• Stochastic games
• Borel determinacy
• Two-player stochastic games. I: A reduction
• Two-player stochastic games. II: The case of recursive games
• The determinacy of Blackwell games
• Mathematical Foundations of Computer Science 2005
• Algorithms for Omega-Regular Games with Imperfect Information
• The Complexity of Tree Automata and Logics of Programs
• Concurrent reachability games
• Supervisory Control of a Class of Discrete Event Processes
• Title not available (Why is that?)
• Title not available (Why is that?)
• Results on the propositional \(\mu\)-calculus
• Positional strategies for mean payoff games
• Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
• Title not available (Why is that?)
• Computer Science Logic
• Title not available (Why is that?)
• Title not available (Why is that?)
• A subexponential randomized algorithm for the simple stochastic game problem
• On the synthesis of strategies in infinite games
• On the synthesis of discrete controllers for timed systems
• Strategy Improvement and Randomized Subexponential Algorithms for Stochastic Parity Games
• Quantitative stochastic parity games
• Automata, Languages and Programming
• Strategy Improvement for Stochastic Rabin and Streett Games
• Infinite games on finitely coloured graphs with applications to automata on infinite trees
• Infinite games played on finite graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Recursive Concurrent Stochastic Games
• A deterministic subexponential algorithm for solving parity games
• Play to Test
• Game Refinement Relations and Metrics
• Title not available (Why is that?)
• Title not available (Why is that?)
• The element of surprise in timed games.
• Automata, Languages and Programming
• Title not available (Why is that?)
• Number of quantifiers is better than number of tape cells
• Stay-in-a-set games
• Fair simulation
• Title not available (Why is that?)
• Title not available (Why is that?)
• The complexity of quantitative concurrent parity games
• On the menbership problem for functional and multivalued dependencies in relational databases
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Quantitative solution of \(\omega\)-regular games
• Computer Science Logic
• Foundations of Software Science and Computation Structures
• Stochastic Müller Games are PSPACE-Complete
• Solving Sequential Conditions by Finite-State Strategies
• Title not available (Why is that?)
• Optimal Strategy Synthesis in Stochastic Müller Games
• Generalized Parity Games
• CONCUR 2005 – Concurrency Theory
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
• Stochastic limit-average games are in EXPTIME

Cited In (49)

• Title not available (Why is that?)
• Playing Against Fair Adversaries in Stochastic Games with Total Rewards
• Comparison of algorithms for simple stochastic games
• On concurrent games with payoff
• On the relation between reactive synthesis and supervisory control of non-terminating processes
• Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games
• Verification and control for probabilistic hybrid automata with finite bisimulations
• Iterated Boolean games
• Verification and control of probabilistic rectangular hybrid automata
• The complexity of synchronizing Markov decision processes
• Automated Verification of Concurrent Stochastic Games
• Symbolic verification and strategy synthesis for turn-based stochastic games
• Stochastic Müller Games are PSPACE-Complete
• Symbolic Model Checking in Non-Boolean Domains
• On the Complexity of Reachability in Parametric Markov Decision Processes
• The uniform measure of simple regular sets of infinite trees
• Automatic verification of concurrent stochastic systems
• Quantitative verification and strategy synthesis for stochastic games
• Title not available (Why is that?)
• Title not available (Why is that?)
• Perfect information games where each player acts only once
• Stochastic window mean-payoff games
• Stochastic games with lexicographic objectives
• Stochastic games with disjunctions of multiple objectives
• Graph Games and Reactive Synthesis
• Decoy allocation games on graphs with temporal logic objectives
• Title not available (Why is that?)
• Model-checking iterated games
• From model checking to equilibrium checking: reactive modules for rational verification
• Mean-payoff games with \(\omega\)-regular specifications
• Entropic risk for turn-based stochastic games
• Stochastic games with synchronizing objectives
• On the determinacy of concurrent games on event structures with infinite winning sets
• A note on the Nash equilibria of some multi-player reachability/safety games
• Title not available (Why is that?)
• Parameterized Algorithms for Parity Games
• Reachability and safety objectives in Markov decision processes on long but finite horizons
• Turn-based stochastic games
• Simplifying optimal strategies in \(\limsup\) and \(\liminf\) stochastic games
• Equilibrium in two-player stochastic games with shift-invariant payoffs
• Two variable vs. linear temporal logic in model checking and games
• Imperfect information in reactive modules games
• Doomsday equilibria for omega-regular games
• Symbolic control for stochastic systems via finite parity games
• A survey of partial-observation stochastic parity games
• Multi-agent verification and control with probabilistic model checking
• Bounds for synchronizing Markov decision processes
• The Symbolic Approach to Repeated Games (Abstract)
• Selfish cops and passive robber: qualitative games

This page was built for publication: A survey of stochastic \(\omega \)-regular games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q414898)