We propose a new approach to study the stability of the optimal filter w.r.t. its initial condition, by introducing a "robust" filter, which is exponentially stable and which approximates the optimal filter uniformly in time. The "robust" filter is obtained here by truncation of the likelihood...

In this paper we provide existence and uniqueness results for the solution of BSDEs driven by a general square-integrable martingale under partial information. We discuss some special cases where the solution to a BSDE under restricted information can be derived by that related to a problem of a...

The motivation of this paper is to prove verification theorems for stochastic optimal control of finite dimensional diffusion processes without control in the diffusion term, in the case where the value function is assumed to be continuous in time and once differentiable in the space variable...

This paper is devoted to presenting a method of proving verification theorems for stochastic optimal control of finite dimensional diffusion processes without control in the diffusion term. The value function is assumed to be continuous in time and once differentiable in the space variable...

If X and Y are two general stochastic processess, we define a covariation process [X, Y] with the help of a limit procedure. When the processes are semimartingales, [X, Y] is their classical bracket. We calculate covariation for some important examples arising from anticipating stochastic...

This article focuses on a recent concept of covariation for processes taking values in a separable Banach space <InlineEquation ID="IEq1"> <EquationSource Format="TEX">$$B$$</EquationSource> <EquationSource Format="MATHML"> <math xmlns:xlink="http://www.w3.org/1999/xlink"> <mi>B</mi> </math> </EquationSource> </InlineEquation> and a corresponding quadratic variation. The latter is more general than the classical one of Métivier and Pellaumail. Those notions are associated with some subspace <InlineEquation ID="IEq2"> <EquationSource...</equationsource></inlineequation></equationsource></equationsource></inlineequation>

The paper proposes and applies a method for systematically sorting and reducing the number of different possible solutions to a network design problem (NDP). This is achieved first by defining a topological similarity measurement and then by applying cluster analysis. The NDP can be derived from...