Pages that link to "Item:Q5108256"
From MaRDI portal
The following pages link to Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations (Q5108256):
Displaying 4 items.
- Model-free reinforcement learning for branching Markov decision processes (Q832301) (← links)
- On polynomial cases of the unichain classification problem for Markov decision processes (Q957336) (← links)
- Greatest fixed points of probabilistic min/max polynomial equations, and reachability for branching Markov decision processes (Q1641009) (← links)
- Polynomial-Time Computation of Strong and <i>n</i>-Present-Value Optimal Policies in Markov Decision Chains (Q5359111) (← links)
