A contractive method for computing the stationary solution of the euler equation

A contractive method for computing stationary solutions of intertemporal equilibrium models is provide. The method is is implemented using a contraction mapping derived from the first-order conditions. The deterministic dynamic programming problem is used to illustrate the method. Some numerical examples are performed.

Integrability and the demand for monetary assets: an alternative approach to an old problem

This note provides necessary and su¢cient conditions for some speci…c multidimensional consumer’s surplus welfare measures to be well posed (path independent). We motivate the problem by investigating partial-equilibrium measures of the welfare costs of in‡ation. The results can also be used for checking path independence of alternative de…nitions of Divisia indexes of monetary services. Consumer theory classically approaches the integrability problem by considering compensated demands, homothetic preferences or quasi-linear utility functions. Here, instead, we consider demands of monetary assets generated from a shopping-time perspective. Paralleling the above mentioned procedure, of …nding special classes of utility functions that satisfy the integrability conditions, we try to infer what particular properties of the transacting technology could assure path independence of multidimensional welfare measures. We show that the integrability conditions are satis…ed if and only if the transacting technology is blockwise weakly separable. We use two examples to clarify the point.

Programação estocástica para fundos de pensão

Nesta dissertação discutiremos modelos e métodos de soluções de programação estocástica para resolver problemas de ALM em fundos de pensão. Apresentaremos o modelo de (Drijver et al.), baseado na programação estocástica multiestágios inteira-mista. Um estudo de caso para um problema de ALM será apresentado usando simulação de cenários.

Joint dynamic probabilistic constraints with projected linear decision rules

We consider multistage stochastic linear optimization problems combining joint dynamic probabilistic constraints with hard constraints. We develop a method for projecting decision rules onto hard constraints of wait-and-see type. We establish the relation between the original (in nite dimensional) problem and approximating problems working with projections from di erent subclasses of decision policies. Considering the subclass of linear decision rules and a generalized linear model for the underlying stochastic process with noises that are Gaussian or truncated Gaussian, we show that the value and gradient of the objective and constraint functions of the approximating problems can be computed analytically.