scientific article; zbMATH DE number 7561608
From MaRDI portal
Publication:5091277
DOI10.4230/LIPIcs.ICALP.2019.115MaRDI QIDQ5091277
Kousha Etessami, Emanuel Martinov, Mihalis Yannakakis, Alistair Stewart
Publication date: 21 July 2022
Full work available at URL: https://arxiv.org/abs/1806.03907
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
reachabilitystochastic gamesconcurrent gamesmulti-type branching processesalmost-surelimit-sureminimax-polynomial equations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Qualitative reachability in stochastic BPA games
- Reachability in recursive Markov decision processes
- The complexity of stochastic games
- Greatest fixed points of probabilistic min/max polynomial equations, and reachability for branching Markov decision processes
- The complexity of solving reachability games using value and strategy iteration
- Concurrent reachability games
- Totally expanding multiplicative systems
- A lattice-theoretical fixpoint theorem and its applications
- Recursive Markov Decision Processes and Recursive Stochastic Games
- Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations
- Approximating the Value of a Concurrent Reachability Game in the Polynomial Time Hierarchy
- Model Checking Stochastic Branching Processes
- Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations
- Recursive Stochastic Games with Positive Rewards
- Growth Optimality for Branching Markov Decision Chains
- Optimization of Multitype Branching Processes
- Expected Termination Time in BPA Games
- Branching Processes
- Model Checking Probabilistic Pushdown Automata
- A Polynomial Time Algorithm for Computing Extinction Probabilities of Multitype Branching Processes
- Analysis of Probabilistic Basic Parallel Processes
- Recursive Concurrent Stochastic Games
- Branching processes in biology
This page was built for publication:
