scientific article; zbMATH DE number 7269250
From MaRDI portal
Publication:5129946
Jan Křetínský, Tobias Meggendorfer
Publication date: 3 November 2020
Full work available at URL: https://arxiv.org/abs/1906.06931
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (2)
Value iteration for simple stochastic games: stopping criterion and learning algorithm ⋮ Unnamed Item
Uses Software
Cites Work
- Performance analysis of probabilistic timed automata using digital clocks
- Efficient and Dynamic Algorithms for Alternating Büchi Games and Maximal End-Component Decomposition
- Semantic Labelling and Learning for Parity Game Solving in LTL Synthesis
- Reachability in MDPs: Refining Convergence of Value Iteration
- A Survey of Applications of Markov Decision Processes
- The complexity of probabilistic verification
- Variance Reduced Value Iteration and Faster Algorithms for Solving Markov Decision Processes
- Stochastic invariants for probabilistic termination
- Depth-First Search and Linear Graph Algorithms
- Sound value iteration
- Continuous-time Markov decisions based on partial exploration
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication:
