Maximizing the probability of visiting a set infinitely often for a Markov decision process with Borel state and action spaces

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?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Markov decision processes with applications to finance.
Markov chains and stochastic stability
Multicriteria impulsive control of jump Markov processes
On dynamic programming and statistical decision theory
Functional analysis, Sobolev spaces and partial differential equations
On compactness of the space of policies in stochastic dynamic programming
On dynamic programming: Compactness of the space of policies
On Cournot-Nash equilibrium distributions for games with differential information and discontinuous payoffs
Maximizing the probability of visiting a set infinitely often for a countable state space Markov decision process
Strong uniform value in gambling houses and partially observable Markov decision processes
The expected total cost criterion for Markov decision processes under constraints
Splitting Randomized Stationary Policies in Total-Reward Markov Decision Processes
The Expected Total Cost Criterion for Markov Decision Processes under Constraints: A Convex Analytic Approach
Stationary Policies in Dynamic Programming Models Under Compactness Assumptions
Generalized Equilibrium Results for Games with Incomplete Information
Existence Without Explicit Compactness in Stochastic Dynamic Programming
Conditions for optimality in dynamic programming and for the limit of n-stage optimal policies to be optimal
Controlled random sequences: methods of convex analysis and problems with functional constraints
More Risk-Sensitive Markov Decision Processes
On the chance to visit a goal set infinitely often
Characterization of the Optimal Risk-Sensitive Average Cost in Denumerable Markov Decision Chains
Continuous-Time Markov Decision Processes with Exponential Utility

This page was built for publication: Maximizing the probability of visiting a set infinitely often for a Markov decision process with Borel state and action spaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6639538)