scientific article; zbMATH DE number 6469138

zbMath1318.91027MaRDI QIDQ5501249

Marcin Jurdziński, Krishnendu Chatterjee, Thomas A. Henzinger

Publication date: 3 August 2015

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) 2-person games (91A05) Games involving graphs (91A43) Graph theory (including graph drawing) in computer science (68R10) Stochastic games, stochastic differential games (91A15) Approximation algorithms (68W25)

Related Items (49)

Simplifying optimal strategies in \(\limsup\) and \(\liminf\) stochastic games ⋮ The Complexity of Synthesis from Probabilistic Components ⋮ Graph Games and Reactive Synthesis ⋮ Model Checking Probabilistic Systems ⋮ Stochastic Games with Finitary Objectives ⋮ Measuring Permissivity in Finite Games ⋮ Probabilistic Weighted Automata ⋮ Quantitative verification and strategy synthesis for stochastic games ⋮ Efficient and Dynamic Algorithms for Alternating Büchi Games and Maximal End-Component Decomposition ⋮ Deciding Parity Games in Quasi-polynomial Time ⋮ On canonical forms for zero-sum stochastic mean payoff games ⋮ Latticed-LTL synthesis in the presence of noisy inputs ⋮ Randomization in Automata on Infinite Trees ⋮ A pseudo-polynomial algorithm for mean payoff stochastic games with perfect information and few random positions ⋮ A convex programming-based algorithm for mean payoff stochastic games with perfect information ⋮ Equilibrium in two-player stochastic games with shift-invariant payoffs ⋮ Subgame optimal strategies in finite concurrent games with prefix-independent objectives ⋮ Satisfiability of quantitative probabilistic CTL: rise to the challenge ⋮ Symbolic verification and strategy synthesis for turn-based stochastic games ⋮ Randomness for free ⋮ A survey of stochastic \(\omega \)-regular games ⋮ The complexity of stochastic Müller games ⋮ Synthesising Strategy Improvement and Recursive Algorithms for Solving 2.5 Player Parity Games ⋮ Unnamed Item ⋮ Value Iteration ⋮ Submixing and shift-invariant stochastic games ⋮ Unnamed Item ⋮ Probabilistic opacity for Markov decision processes ⋮ Simple stochastic games with almost-sure energy-parity objectives are in NP and conp ⋮ Concurrent reachability games ⋮ Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives ⋮ Automatic verification of competitive stochastic systems ⋮ A survey of partial-observation stochastic parity games ⋮ Reduction of stochastic parity to stochastic mean-payoff games ⋮ Regularity in PDA Games Revisited ⋮ Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives ⋮ Strategy logic ⋮ Qualitative reachability in stochastic BPA games ⋮ Unnamed Item ⋮ Model-Checking ω-Regular Properties of Interval Markov Chains ⋮ Improving parity games in practice ⋮ CEGAR for compositional analysis of qualitative properties in Markov decision processes ⋮ Model-Free Reinforcement Learning for Stochastic Parity Games ⋮ Decision Problems for Nash Equilibria in Stochastic Games ⋮ Solving Parity Games Using an Automata-Based Algorithm ⋮ Monadic Second Order Logic with Measure and Category Quantifiers ⋮ Unnamed Item ⋮ Measuring and Synthesizing Systems in Probabilistic Environments ⋮ Unnamed Item

This page was built for publication: