Displaying 121 – 140 of 324

Showing per page

Existence of optimal nonanticipating controls in piecewise deterministic control problems

Atle Seierstad (2013)

ESAIM: Control, Optimisation and Calculus of Variations

Optimal nonanticipating controls are shown to exist in nonautonomous piecewise deterministic control problems with hard terminal restrictions. The assumptions needed are completely analogous to those needed to obtain optimal controls in deterministic control problems. The proof is based on well-known results on existence of deterministic optimal controls.

Explicit formulae of distributions and densities of characteristics of a dynamic advertising and pricing model

Kurt L. Helmes, Torsten Templin (2015)

Banach Center Publications

We analyze the optimal sales process of a stochastic advertising and pricing model with constant demand elasticities. We derive explicit formulae of the densities of the (optimal) sales times and (optimal) prices when a fixed finite number of units of a product are to be sold during a finite sales period or an infinite one. Furthermore, for any time t the exact distribution of the inventory, i.e. the number of unsold items, at t is determined and will be expressed in terms of elementary functions....

Exponential convergence for a convexifying equation

Guillaume Carlier, Alfred Galichon (2012)

ESAIM: Control, Optimisation and Calculus of Variations

We consider an evolution equation similar to that introduced by Vese in [Comm. Partial Diff. Eq. 24 (1999) 1573–1591] and whose solution converges in large time to the convex envelope of the initial datum. We give a stochastic control representation for the solution from which we deduce, under quite general assumptions that the convergence in the Lipschitz norm is in fact exponential in time.

Exponential convergence for a convexifying equation

Guillaume Carlier, Alfred Galichon (2012)

ESAIM: Control, Optimisation and Calculus of Variations

We consider an evolution equation similar to that introduced by Vese in [Comm. Partial Diff. Eq. 24 (1999) 1573–1591] and whose solution converges in large time to the convex envelope of the initial datum. We give a stochastic control representation for the solution from which we deduce, under quite general assumptions that the convergence in the Lipschitz norm is in fact exponential in time.

Exponential convergence for a convexifying equation

Guillaume Carlier, Alfred Galichon (2012)

ESAIM: Control, Optimisation and Calculus of Variations

We consider an evolution equation similar to that introduced by Vese in [Comm. Partial Diff. Eq. 24 (1999) 1573–1591] and whose solution converges in large time to the convex envelope of the initial datum. We give a stochastic control representation for the solution from which we deduce, under quite general assumptions that the convergence in the Lipschitz norm is in fact exponential in time.

Exponential utility optimization, indifference pricing and hedging for a payment process

Łukasz Delong (2012)

Applicationes Mathematicae

We deal with pricing and hedging for a payment process. We investigate a Black-Scholes financial market with stochastic coefficients and a stream of liabilities with claims occurring at random times, continuously over the duration of the contract and at the terminal time. The random times of the claims are generated by a random measure with a stochastic intensity of jumps. The claims are written on the asset traded in the financial market and on the non-tradeable source of risk driven by the random...

Finite-dimensionality of information states in optimal control of stochastic systems: a Lie algebraic approach

Charalambos D. Charalambous (1998)

Kybernetika

In this paper we introduce the sufficient statistic algebra which is responsible for propagating the sufficient statistic, or information state, in the optimal control of stochastic systems. Certain Lie algebraic methods widely used in nonlinear control theory, are then employed to derive finite- dimensional controllers. The sufficient statistic algebra enables us to determine a priori whether there exist finite-dimensional controllers; it also enables us to classify all finite-dimensional controllers....

Full cooperation applied to environmental improvements

Monique Jeanblanc, Rafał M. Łochowski, Wojciech Szatzschneider (2015)

Banach Center Publications

We analyse the case of certificates of environmental improvements and full cooperation of two identical agents. We model pollution levels as geometric Brownian motions with quadratic costs of improvements. Our main result is the construction of the optimal improvements strategy in the case of separate actions, collusive actions and fusion. In certain range of the model parameters, the fusion solution generates lower pollution levels than separate and collusive actions.

Geometry of non-holonomic diffusion

Simon Hochgerner, Tudor S. Ratiu (2015)

Journal of the European Mathematical Society

We study stochastically perturbed non-holonomic systems from a geometric point of view. In this setting, it turns out that the probabilistic properties of the perturbed system are intimately linked to the geometry of the constraint distribution. For G -Chaplygin systems, this yields a stochastic criterion for the existence of a smooth preserved measure. As an application of our results we consider the motion planning problem for the noisy two-wheeled robot and the noisy snakeboard.

Growth rates and average optimality in risk-sensitive Markov decision chains

Karel Sladký (2008)

Kybernetika

In this note we focus attention on characterizations of policies maximizing growth rate of expected utility, along with average of the associated certainty equivalent, in risk-sensitive Markov decision chains with finite state and action spaces. In contrast to the existing literature the problem is handled by methods of stochastic dynamic programming on condition that the transition probabilities are replaced by general nonnegative matrices. Using the block-triangular decomposition of a collection...

Identification of optimal policies in Markov decision processes

Karel Sladký (2010)

Kybernetika

In this note we focus attention on identifying optimal policies and on elimination suboptimal policies minimizing optimality criteria in discrete-time Markov decision processes with finite state space and compact action set. We present unified approach to value iteration algorithms that enables to generate lower and upper bounds on optimal values, as well as on the current policy. Using the modified value iterations it is possible to eliminate suboptimal actions and to identify an optimal policy...

Currently displaying 121 – 140 of 324