Approximate Generalizations and Computational Experiments
In this paper I demonstrate how one can generalize finitely many examples to statements about (infinite) classes of economic models. If there exist upper bounds on the number of connected components of one-dimensional linear subsets of the set of parameters for which a conjecture is true, one can conclude that it is correct for all parameter values in the class considered, except for a small residual set, once one has verified the conjecture for a predetermined finite set of points. I show how to apply this insight to computational experiments and spell out assumptions on the economic fundamentals that ensure that the necessary bounds on the number of connected components exist. Copyright The Econometric Society 2007.
Volume (Year): 75 (2007)
Issue (Month): 4 (07)
|Contact details of provider:|| Phone: 1 212 998 3820|
Fax: 1 212 995 4487
Web page: http://www.econometricsociety.org/
More information through EDIRC
|Order Information:|| Web: https://www.econometricsociety.org/publications/econometrica/access/ordering-back-issues Email: |
When requesting a correction, please mention this item's handle: RePEc:ecm:emetrp:v:75:y:2007:i:4:p:967-992. See general information about how to correct material in RePEc.
If references are entirely missing, you can add them using this form.