Approximate Generalizations and Computational Experiments
AbstractIn 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.
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.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Bibliographic InfoArticle provided by Econometric Society in its journal Econometrica.
Volume (Year): 75 (2007)
Issue (Month): 4 (07)
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- Felix Kuber & Karl Schmedders, 2007.
"Competitive Equilibria in Semi-Algebraic Economies,"
PIER Working Paper Archive
07-013, Penn Institute for Economic Research, Department of Economics, University of Pennsylvania.
- Kubler, Felix & Schmedders, Karl, 2010. "Competitive equilibria in semi-algebraic economies," Journal of Economic Theory, Elsevier, vol. 145(1), pages 301-330, January.
- D'Agata, Antonio, 2012. "Existence of an exact Walrasian equilibrium in nonconvex economies," Economics - The Open-Access, Open-Assessment E-Journal, Kiel Institute for the World Economy, vol. 6(12), pages 1-16.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Wiley-Blackwell Digital Licensing) or (Christopher F. Baum).
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.