On the chance to visit a goal set infinitely often
From MaRDI portal
Publication:5202041
Recommendations
- Maximizing the probability of visiting a set infinitely often for a countable state space Markov decision process
- On maximizing the average time at a goal
- Target-level criterion in Markov decision processes
- Markov decision processes associated with two threshold probability criteria
- scientific article; zbMATH DE number 1786649
Cites work
- scientific article; zbMATH DE number 3148886 (Why is no real title available?)
- scientific article; zbMATH DE number 3216771 (Why is no real title available?)
- A "Fatou Equation" for Randomly Stopped Variables
- A Finite Controlled Markov Chain with Small Termination Probability
- A Gambling Theorem and Optimal Stopping Theory
- An expected average reward criterion
- Continuity of mean recurrence times in denumerable semi-Markov processes
- Countably additive gambling and optimal stopping
- Discounted Dynamic Programming
- Discrete Dynamic Programming
- Finite state Markovian decision processes
- On maximizing the average time at a goal
- Perturbation theory and finite Markov chains
Cited in
(3)
This page was built for publication: On the chance to visit a goal set infinitely often
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5202041)