Using results from the literature on H-control, this paper incorporates model uncertainty into Whiteman's (1986) frequency domain approach to stabilization policy. The derived policies guarantee a minimum performance level even in the worst of (a bounded set of) circumstances. ; For a given...

Evolutionary programming is a stochastic optimization procedure that has proved useful in optimizing difficult functions. This paper shows that evolutionary programming can be used to solve the Bellman equation problem with a high degree of accuracy and substantially less CPU time than Bellman...

Over the past decade, a substantial literature on the estimation of discrete choice dynamic programming (DC-DP) models of behavior has developed. However, this literature now faces major computational barriers. Specifically, in order to solve the dynamic programming (DP) problems that generate...

This article investigates the use of genetic programming to forecast out-of-sample daily volatility in the foreign exchange market. Forecasting performance is evaluated relative to GARCH(1,1) and RiskMetrics models for two currencies, DEM and JPY. Although the GARCH/RiskMetrics models appear to...

Computers are deterministic devices, and a computer-generated random number is a contradiction in terms. As a result, computer-generated pseudorandom numbers are fraught with peril for the unwary. We summarize much that is known about the most well-known pseudorandom number generators:...

Computers are deterministic devices, and a computer-generated random number is a contradiction in terms. As a result, computer-generated pseudorandom numbers are fraught with peril for the unwary. We summarize much that is known about the most well-known pseudorandom number generators:...

Using genetic programming techniques to find technical trading rules, we find strong evidence of economically significant out-of-sample excess returns to those rules for each of six exchange rates, over the period 1981-1995. Further, when the dollar/deutschemark rules are allowed to determine...

This note shows that basic theorems of dynamic programming hold when the return function is homogeneous of degree theta <= 1.