Recursive Markov decision processes and recursive stochastic games
From MaRDI portal
Markov decision processesmultitype branching processesrecursive stochastic processesstochastic context-free grammarsstochastic games
Branching processes (Galton-Watson, birth-and-death, etc.) (60J80) Analysis of algorithms and problem complexity (68Q25) Grammars and rewriting systems (68Q42) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Markov and semi-Markov decision processes (90C40) Stochastic games, stochastic differential games (91A15)
Recommendations
- Automata, Languages and Programming
- Efficient Qualitative Analysis of Classes of Recursive Markov Decision Processes and Simple Stochastic Games
- Recursive stochastic games with positive rewards
- Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations
- Recursive Stochastic Games with Positive Rewards
Cites work
- A lattice-theoretical fixpoint theorem and its applications
- A strongly polynomial algorithm for criticality of branching processes and consistency of stochastic context-free grammars
- A Turnpike Theorem For A Risk-Sensitive Markov Decision Process with Stopping
- An inequality for the discriminant of a polynomial
- Approximative Methods for Monotone Systems of Min-Max-Polynomial Equations
- Automata, Languages and Programming
- Branching Processes
- Branching processes in biology
- Computing the least fixed point of positive polynomial systems
- Concurrent reachability games
- Efficient Qualitative Analysis of Classes of Recursive Markov Decision Processes and Simple Stochastic Games
- Finitely additive stochastic games with Borel measurable payoffs
- Growth Optimality for Branching Markov Decision Chains
- Handbook of Markov decision processes. Methods and applications
- scientific article; zbMATH DE number 3128726 (Why is no real title available?)
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 3736680 (Why is no real title available?)
- scientific article; zbMATH DE number 3555176 (Why is no real title available?)
- scientific article; zbMATH DE number 3588048 (Why is no real title available?)
- scientific article; zbMATH DE number 1263212 (Why is no real title available?)
- scientific article; zbMATH DE number 1134975 (Why is no real title available?)
- scientific article; zbMATH DE number 1538049 (Why is no real title available?)
- scientific article; zbMATH DE number 3371972 (Why is no real title available?)
- scientific article; zbMATH DE number 3410334 (Why is no real title available?)
- scientific article; zbMATH DE number 3190745 (Why is no real title available?)
- Introduction to Matrix Analytic Methods in Stochastic Modeling
- Markov decision processes and regular events
- Matrix Analysis
- Model checking of recursive probabilistic systems
- Multiplicative Systems
- On the Complexity of Nash Equilibria and Other Fixed Points
- On the computational complexity and geometry of the first-order theory of the reals. I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals
- On the Existence of Stationary Optimal Strategies
- On the undecidability of probabilistic planning and related stochastic optimization problems
- Optimization of Multitype Branching Processes
- Polynomial time algorithms for branching Markov decision processes and probabilistic min(max) polynomial Bellman equations
- Polynomial time algorithms for multi-type branching processes and stochastic context-free grammars
- Positional strategies for mean payoff games
- Quantitative solution of omega-regular games
- Random walks with “back buttons” (extended abstract)
- Recursive Concurrent Stochastic Games
- Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations
- Recursive Stochastic Games with Positive Rewards
- Stochastic Games
- Termination of Probabilistic Concurrent Program
- The complexity of mean payoff games on graphs
- The complexity of probabilistic verification
- The complexity of quantitative concurrent parity games
- The complexity of stochastic games
- The determinacy of Blackwell games
- Totally expanding multiplicative systems
- Undecidable problems for probabilistic automata of fixed dimension
Cited in
(34)- Two-player stochastic games. II: The case of recursive games
- Approximating the termination value of one-counter MDPs and stochastic games
- The uniform measure of simple regular sets of infinite trees
- A denotational semantics for low-level probabilistic programs with nondeterminism
- Recursive stochastic games with positive rewards
- Existence and determination of the value and optimal strategies in recursive games
- Markov decision processes and stochastic games with total effective payoff
- Approximating the termination value of one-counter MDPs and stochastic games
- Computing Game Metrics on Markov Decision Processes
- Recursive Stochastic Games with Positive Rewards
- Forward Recursion for Markov Decision Processes with Skip-Free-to-the-Right Transitions, Part I: Theory and Algorithm
- Recursive Repeated Games with Absorbing States
- scientific article; zbMATH DE number 1748679 (Why is no real title available?)
- Separable GPL: decidable model checking with more non-determinism
- Optimally Resilient Strategies in Pushdown Safety Games
- scientific article; zbMATH DE number 7561608 (Why is no real title available?)
- Polynomial time algorithms for branching Markov decision processes and probabilistic min(max) polynomial Bellman equations
- On the termination problem for probabilistic higher-order recursive programs
- Cost vs. Time in Stochastic Games and Markov Automata
- One-counter Markov decision processes
- Efficient Qualitative Analysis of Classes of Recursive Markov Decision Processes and Simple Stochastic Games
- Automata, Languages and Programming
- Reachability in Recursive Markov Decision Processes
- Strategy Complexity of Point Payoff, Mean Payoff and Total Payoff Objectives in Countable MDPs
- Recursive Concurrent Stochastic Games
- Recursive Concurrent Stochastic Games
- Probabilistic total store ordering
- Overcoming memory weakness with unified fairness. Systematic verification of liveness in weak memory models
- Positivity-hardness results on Markov decision processes
- Strategy complexity of limsup and liminf threshold objectives in countable MDPs, with applications to optimal expected payoffs
- The recursive arrival problem
- A unifying approach to probabilistic testing equivalences
- Model-free reinforcement learning for branching Markov decision processes
- Reachability in recursive Markov decision processes
This page was built for publication: Recursive Markov decision processes and recursive stochastic games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2796398)
