This file is part of IDEAS, which uses RePEc data


[ Papers | Articles | Software | Books | Chapters | Authors | Institutions | JEL Classification | NEP reports | Search | New papers by email | Author registration | Rankings | Volunteers | FAQ | Blog | Help! ]

Robustness of computer algorithms to simulate optimal experimentation problems

Author info | Abstract | Publisher info | Download info | Related research | Statistics
Author Info
Thomas Cosimano () (University of Notre Dame)
Michael Gapen (International Monetary Fund)
David Kendrick (University of Texas)
Volker Wieland (Goethe University of Frankfurt)

Additional information is available for the following registered author(s):

Abstract

Three 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 Info
To download:

If you experience problems downloading a file, check if you have the proper application to view it first. Information about this may be contained in the File-Format links below. 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.

File URL: http://repec.org/sce2006/up.28241.1137610390.pdf
File Format: application/pdf
File Function:
Download Restriction: no

Publisher Info
Paper provided by Society for Computational Economics in its series Computing in Economics and Finance 2006 with number 32.

Download reference. The following formats are available: HTML (with abstract), plain text (with abstract), BibTeX, RIS (EndNote, RefMan, ProCite), ReDIF
Length:
Date of creation: 04 Jul 2006
Date of revision:
Handle: RePEc:sce:scecfa:32

Contact details of provider:
Email:
Web page: http://comp-econ.org/
More information through EDIRC

For technical questions regarding this item, or to correct its listing, contact: (Christopher F. Baum).

Related research
Keywords:

Find related papers by JEL classification:
C44 - Mathematical and Quantitative Methods - - Econometric and Statistical Methods: Special Topics - - - Statistical Decision Theory; Operations Research
C60 - Mathematical and Quantitative Methods - - Mathematical Methods and Programming - - - 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

This paper has been announced in the following NEP Reports:

Statistics
Access and download statistics

Did you know? You too can volunteer for RePEc, for example by editing a NEP report.

This page was last updated on 2009-11-13.

This information is provided to you by IDEAS at the Department of Economics, College of Liberal Arts and Sciences, University of Connecticut using RePEc data on a server sponsored by the Society for Economic Dynamics.