AbstractFor countable-state decision processes (dynamic programming problems), a general class of objective functions is identified for which it is shown that good Markov strategies always exist. This class includes product and lim inf rewards, as well as practically all the classical dynamic programming expected payoff functions
We shall be concerned with the optimization problem of semi-Markov decision processes with countable...
In the paper it is demonstrated, how a dynamic programming approach may be useful for the analysis o...
For Markov decision processes with countable state space and nonnegative immediate rewards Ornstein ...
AbstractFor countable-state decision processes (dynamic programming problems), a general class of ob...
This paper gives a systematic treatment of results about the existence of various types of nearly-op...
This paper gives a systematic treatment of results about the existence of various types of nearly-op...
This paper gives a systematic treatment of results about the existence of various types of nearly-op...
In this paper the following result is proved. In any total reward countable state Markov decision pr...
We are interested in the existence of pure and stationary optimal strategies in Markov decision proc...
(Extended version of Memorandum COSOR 81-11) This paper deals with total reward Markov decision proc...
Abstract. We study the existence of optimal strategies and value func-tion of non stationary Markov ...
In this paper the following result is proved. In any total reward countable state Markov decision pr...
In this paper the following result is proved. In any total reward countable state Markov decision pr...
A Markov decision process (MDP) relies on the notions of state, describing the current situation of ...
We study countably infinite Markov decision processes with Büchi objectives, which ask to visit a gi...
We shall be concerned with the optimization problem of semi-Markov decision processes with countable...
In the paper it is demonstrated, how a dynamic programming approach may be useful for the analysis o...
For Markov decision processes with countable state space and nonnegative immediate rewards Ornstein ...
AbstractFor countable-state decision processes (dynamic programming problems), a general class of ob...
This paper gives a systematic treatment of results about the existence of various types of nearly-op...
This paper gives a systematic treatment of results about the existence of various types of nearly-op...
This paper gives a systematic treatment of results about the existence of various types of nearly-op...
In this paper the following result is proved. In any total reward countable state Markov decision pr...
We are interested in the existence of pure and stationary optimal strategies in Markov decision proc...
(Extended version of Memorandum COSOR 81-11) This paper deals with total reward Markov decision proc...
Abstract. We study the existence of optimal strategies and value func-tion of non stationary Markov ...
In this paper the following result is proved. In any total reward countable state Markov decision pr...
In this paper the following result is proved. In any total reward countable state Markov decision pr...
A Markov decision process (MDP) relies on the notions of state, describing the current situation of ...
We study countably infinite Markov decision processes with Büchi objectives, which ask to visit a gi...
We shall be concerned with the optimization problem of semi-Markov decision processes with countable...
In the paper it is demonstrated, how a dynamic programming approach may be useful for the analysis o...
For Markov decision processes with countable state space and nonnegative immediate rewards Ornstein ...
DOI
Add to ORKG