Efficient approximation of optimal control for continuous-time Markov games
From MaRDI portal
Publication:259052
DOI10.1016/j.ic.2015.12.002zbMath1337.91015OpenAlexW2278165153MaRDI QIDQ259052
John Fearnley, Markus N. Rabe, Sven Schewe, Li-jun Zhang
Publication date: 10 March 2016
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2015.12.002
Optimal stochastic control (93E20) Stochastic games, stochastic differential games (91A15) Markov and semi-Markov decision processes (90C40) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items (3)
Optimal decisions for continuous time Markov decision processes over finite planning horizons ⋮ A uniformization-based algorithm for continuous-time stochastic games model checking ⋮ Attracting sets of discrete-time Markovian jump delay systems with stochastic disturbances via impulsive control
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Numerical analysis of continuous time Markov decision processes over finite horizons
- Interactive Markov chains. And the quest for quantified quality
- Finite optimal control for time-bounded reachability in CTMDPs and continuous-time Markov games
- A survey of recent results on continuous-time Markov decision processes (with comments and rejoinder)
- Optimal time-abstract schedulers for CTMDPs and continuous-time Markov games
- On the semantics of Markov automata
- Continuous-time stochastic games with time-bounded reachability
- Finite state continuous time Markov decision processes with an infinite planning horizon
- Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes
- Efficient Approximation of Optimal Control for Markov Games
- Continuous-Time Stochastic Games with Time-Bounded Reachability.
- Improving Time Bounded Reachability Computations in Interactive Markov Chains
- Solving Ordinary Differential Equations I
- Optimal Continuous Time Markov Decisions
- A Characterization of Meaningful Schedulers for Continuous-Time Markov Decision Processes
- Model Checking Interactive Markov Chains
- Delayed Nondeterminism in Continuous-Time Markov Decision Processes
- Towards Performance Prediction of Compositional Models in Industrial GALS Designs
- Sliding Window Abstraction for Infinite Markov Chains
- Maximal Cost-Bounded Reachability Probability on Continuous-Time Markov Decision Processes
- Optimal Control of a Continuous-Time Markov Chain with Periodic Transition Probabilities
- Finite State Continuous Time Markov Decision Processes with a Finite Planning Horizon
This page was built for publication: Efficient approximation of optimal control for continuous-time Markov games
