This paper presents a numerical nonlinear dynamic programming algorithm for solving so-called optimal learning or adaptive control problems. These are decision problems with unknown parameters where the decisionmaker updates beliefs by Bayes rule. The updating equations are nonlinear. As a result the dynamic decision problem exhibits mulitiple optima, nondifferentiability of the value function and discontinuity of the policy function. Computational complexity rises quickly as multiple state variables are need to describe the evolution of the decisionmaker's beliefs. The algorithm presented delivers approximations to optimal policies for a class of optimal learning problems.
Download Info
To our knowledge, this item is not available for
download. To find whether it is available, there are three
options:
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page
whether it is in fact available.
3. Perform a search for a similarly titled item that would be
available.
Find related papers by JEL classification: C61 - Mathematical and Quantitative Methods - - Mathematical Methods and Programming - - - Optimization Techniques; Programming Models; Dynamic Analysis C63 - Mathematical and Quantitative Methods - - Mathematical Methods and Programming - - - Computational Techniques
Cited by: (explanations, Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.)