On the chance to visit a goal set infinitely often
From MaRDI portal
Publication:5202041
DOI10.1080/02331939008843583zbMATH Open0723.90086OpenAlexW1980691662MaRDI QIDQ5202041FDOQ5202041
Authors: Manfred Schäl 
Publication date: 1990
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331939008843583
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
Dynamic programming (90C39) Stopping times; optimal stopping problems; gambling theory (60G40) Markov and semi-Markov decision processes (90C40) Probabilistic games; gambling (91A60)
Cites Work
- Title not available (Why is that?)
- Perturbation theory and finite Markov chains
- Finite state Markovian decision processes
- Discrete Dynamic Programming
- Title not available (Why is that?)
- Discounted Dynamic Programming
- A "Fatou Equation" for Randomly Stopped Variables
- On maximizing the average time at a goal
- Continuity of mean recurrence times in denumerable semi-Markov processes
- Countably additive gambling and optimal stopping
- An expected average reward criterion
- A Gambling Theorem and Optimal Stopping Theory
- A Finite Controlled Markov Chain with Small Termination Probability
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)
