Robustness of computer algorithms to simulate optimal experimentation problems
AbstractThree methods have been developed by the authors for solving optimal experimentation problems. David Kendrick (1981, 2002, Ch.10) uses quadratic approximation of the value function and linear approximation of the equation of motion to simulate general optimal experimentation (active learning) problems. Beck and Volker Wieland (2002) use dynamic programming methods to develop an algorithm for optimal experimentation problems. Cosimano (2003) and Cosimano and Gapen (2005) use the Perturbation method to develop an algorithm for solving optimal experimentation problems. The perturbation is in the neighborhood of the augmented linear regulator problems of Hansen and Sargent (2004). In this paper we take an example from Beck and Wieland which fits into the setup of all three algorithms. Using this example we examine the cost and benefits of the various algorithms for solving optimal experimentation problems.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by Society for Computational Economics in its series Computing in Economics and Finance 2006 with number 32.
Date of creation: 04 Jul 2006
Date of revision:
Find related papers by JEL classification:
- C44 - Mathematical and Quantitative Methods - - Econometric and Statistical Methods: Special Topics - - - Operations Research; Statistical Decision Theory
- C60 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - General
- D81 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Criteria for Decision-Making under Risk and Uncertainty
- D82 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Asymmetric and Private Information; Mechanism Design
This paper has been announced in the following NEP Reports:
- NEP-ALL-2006-07-15 (All new papers)
You can help add them by filling out this form.
reading list or among the top items on IDEAS.Access and download statisticsgeneral information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Christopher F. Baum).
If references are entirely missing, you can add them using this form.