The paper studies off-line computation of the Stackelberg solution in a repeated game framework, utilizing the Genetic Algorithm. Simulations are conducted with a numerical linear quadratic example and a Fish War game example. Furthermore, it is shown that an evolutionary mutation probability is...

Computing the solution to a stochastic optimal control problem is difficult. A method of approximating a solution to a given stochatic optimal problem was developed in [1]. This paper describes a suite of Matlab functions implementing this method of approximating a solution to a given continuous...

Strategies for constructing a Markov decision chain approximating a continuous-time finite-horizon optimal control problem are investigated. Some simple, analytically soluble, examples are treated and low computational complexity is reported. Extensions to the method and implementation are...

Relaxation algorithms provide a powerful method of finding noncooperative equilibria in general synchronous games. Through use of the Nikaido-Isoda function, the Nash solution to a broad category of constrained, multiplayer, non-zerosum games can easily be found. We provide solutions to some...

In this paper we present a theoretically founded procedure in order to check for saddlepoint stability of rational expectations models. The proposed device uses some specific perturbed finite time approximations of the models and allows for an explicit theoretical foundation. Numerical evidence...

In this paper we investigate theoretically the numerical bias due to the truncation of structurally infinite time forward-looking models, by the means of various terminal conditions. On a general multivariate optimal growth model, we first analytically confirm some well-known heuristic...