What Can Economists Compute?

Marcel Richter and Kam-Chau Wong (b707721@mailserv.cuhk.edu.hk)
Additional contact information
Kam-Chau Wong: Chinese University of Hong Kong

No 1121, Computing in Economics and Finance 1999 from Society for Computational Economics

Abstract: 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.

Date: 1999-03-01
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:sce:scecf9:1121

Access Statistics for this paper

More papers in Computing in Economics and Finance 1999 from Society for Computational Economics CEF99, Boston College, Department of Economics, Chestnut Hill MA 02467 USA. Contact information at EDIRC.
Bibliographic data for series maintained by Christopher F. Baum (baum@bc.edu).