Model-Free Reinforcement Learning for Stochastic Parity Games
From MaRDI portal
Publication:5089286
DOI10.4230/LIPICS.CONCUR.2020.21OpenAlexW3082540285MaRDI QIDQ5089286FDOQ5089286
Mateo Perez, Dominik Wojtczak, Fabio Somenzi, Sven Schewe, Ashutosh Trivedi, Ernst Moritz Hahn
Publication date: 18 July 2022
Full work available at URL: https://doi.org/10.4230/lipics.concur.2020.21
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The complexity of stochastic games
- Stochastic Games
- \({\mathcal Q}\)-learning
- The complexity of probabilistic verification
- A game of cops and robbers
- The O.D.E. Method for Convergence of Stochastic Approximation and Reinforcement Learning
- The Complexity of Solving Stochastic Games on Graphs
- Reduction of stochastic parity to stochastic mean-payoff games
- Computer Science Logic
- Tools and Algorithms for the Construction and Analysis of Systems
- Limit-Deterministic Büchi Automata for Linear Temporal Logic
- Lazy probabilistic model checking without determinisation
- Good-for-MDPs Automata for Probabilistic Analysis and Reinforcement Learning
- A Simple Algorithm for Solving Qualitative Probabilistic Parity Games
Cited In (6)
- Model-Based Reinforcement Learning for Partially Observable Games with Sampling-Based State Estimation
- Alternating good-for-MDPs automata
- Specification-guided reinforcement learning
- An impossibility result in automata-theoretic reinforcement learning
- AI 2003: Advances in Artificial Intelligence
- A framework for transforming specifications in 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)