What Can Economists Compute?
AbstractWe present a theoretical view of computation, delineating what types of approximations are possible and what types are impossible. A practical consequence is an approximation algorithm with numerous applications. For several classical problems (finding maximizers, fixed points, equilibrium prices, zeros) we provide a general digital algorithm to approximate solutions (without taking subsequences). We show, however, that no general effective approximation method exits. Controllability of error levels thus emerges as a dividing line between the possible and the impossible. The results highlight the importance of finding special contexts in which special algorithms can be effective. We compare our methods and results with those of Scarf.
Download InfoTo 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.
Bibliographic InfoPaper provided by Society for Computational Economics in its series Computing in Economics and Finance 1999 with number 1121.
Date of creation: 01 Mar 1999
Date of revision:
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.