We computationally assess policies for the elevator control problem by a new column-generation approach for the linear programming method for discounted infinite-horizon Markov decision problems. By analyzing the optimality of given actions in given states, we were able to provably improve the...

We computationally assess policies for the elevator control problem by a new column-generation approach for the linear programming method for discounted infinite-horizon Markov decision problems. By analyzing the optimality of given actions in given states, we were able to provably improve the...

A class of stochastic games with additive reward and transition structure is studied. For zero-sum games under some ergodicity assumptions 1-equilibria are shown to exist. They correspond to so-called sensitive optimal policies in dynamic programming. For a class of nonzero-sum stochastic games...

A class of stochastic games with additive reward and transition structure is studied. For zero-sum games under some ergodicity assumptions 1-equilibria are shown to exist. They correspond to so-called sensitive optimal policies in dynamic programming. For a class of nonzero-sum stochastic games...

In this paper weighted singularly perturbed hybrid stochastic systems are discussed. Under some reasonable assumptions, it is shown that there exists a uniformly δ-optimal policy when the perturbation is sufficiently small. Copyright Springer-Verlag Berlin Heidelberg 2005

In this paper weighted singularly perturbed hybrid stochastic systems are discussed. Under some reasonable assumptions, it is shown that there exists a uniformly δ-optimal policy when the perturbation is sufficiently small. Copyright Springer-Verlag Berlin Heidelberg 2005

This paper deals with a Markovian decision process with an absorbing set J 0 . We are interested in the largest number β *≥1, called the critical discount factor, such that for all discount factors β smaller than β * the limit V of the N-stage value function V N for N →∞ exists and is...

This paper deals with a Markovian decision process with an absorbing set J <Subscript>0</Subscript>. We are interested in the largest number β<Superscript>*</Superscript>≥1, called the critical discount factor, such that for all discount factors β smaller than β<Superscript>*</Superscript> the limit V of the N-stage value function V <Subscript>N</Subscript> for N →∞ exists and is...</subscript></superscript></superscript></subscript>

We consider a sequence of discounted cost, constrained Markov control processes (CCPs) with countable state space, metric action set and possibly unbounded cost functions. We give conditions under which the sequence of optimal values of the CCPs converges to the optimal value of a limiting CCP,...