What Can Economists Compute?
We 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.
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.
|Date of creation:||01 Mar 1999|
|Date of revision:|
|Contact details of provider:|| Postal: |
Web page: http://fmwww.bc.edu/CEF99/
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:sce:scecf9:1121. See general 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.