Displaying similar documents to “On optimal stopping of inhomogeneous standard Markov processes.”

Average cost Markov control processes with weighted norms: value iteration

Evgueni Gordienko, Onésimo Hernández-Lerma (1995)

Applicationes Mathematicae

Similarity:

This paper shows the convergence of the value iteration (or successive approximations) algorithm for average cost (AC) Markov control processes on Borel spaces, with possibly unbounded cost, under appropriate hypotheses on weighted norms for the cost function and the transition law. It is also shown that the aforementioned convergence implies strong forms of AC-optimality and the existence of forecast horizons.

A consumption-investment problem modelled as a discounted Markov decision process

Hugo Cruz-Suárez, Raúl Montes-de-Oca, Gabriel Zacarías (2011)

Kybernetika

Similarity:

In this paper a problem of consumption and investment is presented as a model of a discounted Markov decision process with discrete-time. In this problem, it is assumed that the wealth is affected by a production function. This assumption gives the investor a chance to increase his wealth before the investment. For the solution of the problem there is established a suitable version of the Euler Equation (EE) which characterizes its optimal policy completely, that is, there are provided...

On the core property of the cylinder functions class in the construction of interacting particle systems

Anja Voss-Böhme (2011)

Kybernetika

Similarity:

For general interacting particle systems in the sense of Liggett, it is proven that the class of cylinder functions forms a core for the associated Markov generator. It is argued that this result cannot be concluded by straightforwardly generalizing the standard proof technique that is applied when constructing interacting particle systems from their Markov pregenerators.

On adaptive control of a partially observed Markov chain

Giovanni Di Masi, Łukasz Stettner (1994)

Applicationes Mathematicae

Similarity:

A control problem for a partially observable Markov chain depending on a parameter with long run average cost is studied. Using uniform ergodicity arguments it is shown that, for values of the parameter varying in a compact set, it is possible to consider only a finite number of nearly optimal controls based on the values of actually computable approximate filters. This leads to an algorithm that guarantees nearly selfoptimizing properties without identifiability conditions. The algorithm...