Model-Free Reinforcement Learning for Stochastic Parity Games
From MaRDI portal
Publication:5089286
Cites work
- scientific article; zbMATH DE number 3145626 (Why is no real title available?)
- scientific article; zbMATH DE number 1161555 (Why is no real title available?)
- scientific article; zbMATH DE number 2050057 (Why is no real title available?)
- scientific article; zbMATH DE number 2206109 (Why is no real title available?)
- scientific article; zbMATH DE number 5585443 (Why is no real title available?)
- A game of cops and robbers
- A reduction from parity games to simple stochastic games
- A simple algorithm for solving qualitative probabilistic parity games
- Computer Science Logic
- Good-for-MDPs automata for probabilistic analysis and reinforcement learning
- Lazy probabilistic model checking without determinisation
- Limit-deterministic Büchi automata for linear temporal logic
- Quantitative stochastic parity games
- Reduction of stochastic parity to stochastic mean-payoff games
- Reinforcement learning. An introduction
- Stochastic Games
- The O.D.E. Method for Convergence of Stochastic Approximation and Reinforcement Learning
- The complexity of probabilistic verification
- The complexity of solving stochastic games on graphs
- The complexity of stochastic games
- Tools and Algorithms for the Construction and Analysis of Systems
- \({\mathcal Q}\)-learning
Cited in
(6)- Specification-guided reinforcement learning
- AI 2003: Advances in Artificial Intelligence
- A framework for transforming specifications in reinforcement learning
- Alternating good-for-MDPs automata
- Model-Based Reinforcement Learning for Partially Observable Games with Sampling-Based State Estimation
- An impossibility result in automata-theoretic reinforcement learning
This page was built for publication: Model-Free Reinforcement Learning for Stochastic Parity Games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5089286)
