Quantitative stochastic parity games
From MaRDI portal
Publication:5501249
zbMATH Open1318.91027MaRDI QIDQ5501249FDOQ5501249
Authors: Krishnendu Chatterjee, Marcin Jurdziński, Thomas A. Henzinger 
Publication date: 3 August 2015
Recommendations
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) 2-person games (91A05) Stochastic games, stochastic differential games (91A15) Games involving graphs (91A43)
Cited In (64)
- Model-Free Reinforcement Learning for Stochastic Parity Games
- Improving parity games in practice
- Title not available (Why is that?)
- Title not available (Why is that?)
- Deciding Parity Games in Quasi-polynomial Time
- Life is random, time is not: Markov decision processes with window objectives
- Stochastic parity games on lossy channel systems
- Qualitative reachability in stochastic BPA games
- A survey of stochastic \(\omega \)-regular games
- Probabilistic Weighted Automata
- Symbolic verification and strategy synthesis for turn-based stochastic games
- Regularity in PDA games revisited
- Decision Problems for Nash Equilibria in Stochastic Games
- Simple stochastic games with almost-sure energy-parity objectives are in NP and conp
- A simple algorithm for solving qualitative probabilistic parity games
- Synthesising strategy improvement and recursive algorithms for solving 2.5 player parity games
- Probabilistic opacity for Markov decision processes
- Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives
- Robustness of structurally equivalent concurrent parity games
- Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives
- Model checking probabilistic systems
- Solving simple stochastic tail games
- The Complexity of Synthesis from Probabilistic Components
- Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition
- Model-Checking ω-Regular Properties of Interval Markov Chains
- An \(O(n^2)\) time algorithm for alternating Büchi games
- The complexity of stochastic Müller games
- Nearest fixed points and concurrent priority games
- Parity objectives in countable MDPs
- Measuring and synthesizing systems in probabilistic environments
- Solving parity games using an automata-based algorithm
- Quantitative solution of \(\omega\)-regular games
- CEGAR for compositional analysis of qualitative properties in Markov decision processes
- Quantitative verification and strategy synthesis for stochastic games
- Strategy Improvement and Randomized Subexponential Algorithms for Stochastic Parity Games
- Quantitative solution of omega-regular games
- Title not available (Why is that?)
- Randomness for free
- Strategy Improvement for Stochastic Rabin and Streett Games
- Graph Games and Reactive Synthesis
- Stochastic Games with Finitary Objectives
- Randomization in automata on infinite trees
- Quantitative games with interval objectives
- Latticed-LTL synthesis in the presence of noisy inputs
- Monadic Second Order Logic with Measure and Category Quantifiers
- Measuring Permissivity in Finite Games
- Concurrent reachability games
- Qualitative concurrent parity games: bounded rationality
- A convex programming-based algorithm for mean payoff stochastic games with perfect information
- Subgame optimal strategies in finite concurrent games with prefix-independent objectives
- Strategy logic
- Automatic verification of competitive stochastic systems
- On canonical forms for zero-sum stochastic mean payoff games
- Computer Science Logic
- Recursive Concurrent Stochastic Games
- Simplifying optimal strategies in \(\limsup\) and \(\liminf\) stochastic games
- Equilibrium in two-player stochastic games with shift-invariant payoffs
- Value Iteration
- A survey of partial-observation stochastic parity games
- Reduction of stochastic parity to stochastic mean-payoff games
- Qualitative concurrent parity games
- Submixing and shift-invariant stochastic games
- Satisfiability of quantitative probabilistic CTL: rise to the challenge
- A direct symbolic algorithm for solving stochastic Rabin games
This page was built for publication: Quantitative stochastic parity games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5501249)
