The WALRAS Algorithm: A Convergent Distributed Implementation of General Equilibrium Outcomes
AbstractThe WALRAS algorithm calculates competitive equilibria via a distributed tatonnement-like process, in which agents submit single-good demand functions to market-clearing auctions. The algorithm is asynchronous and decentralized with respect to both agents and markets, making it suitable for distributed implementation. We present a formal description of this algorithm, and prove that it converges under the standard assumption of gross substitutability. We relate our results to the literature on general equilibrium stability and some more recent work on decentralized algorithms. We present some experimental results as well, particularly for cases where the assumptions required to guarantee convergence do not hold. Finally, we consider some extensions and generalizations to the WALRAS algorithm. Citation Copyright 1998 by Kluwer Academic Publishers.
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.
Bibliographic InfoArticle provided by Society for Computational Economics in its journal Computational Economics.
Volume (Year): 12 (1998)
Issue (Month): 1 (August)
Other versions of this item:
- John Q. Cheng & Michael P. Wellman, 1995. "The WALRAS Algorithm: A Convergent Distributed Implementation of General Equilibrium Outcomes," Computational Economics 9508001, EconWPA.
- C8 - Mathematical and Quantitative Methods - - Data Collection and Data Estimation Methodology; Computer Programs
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Reiter, S. & Simon, C., 1990.
"Decentralized Dynamic Processes for Finding Equilibrium,"
90-20, Michigan - Center for Research on Economic & Social Theory.
- Reiter, Stanley & Simon, Carl P., 1992. "Decentralized dynamic processes for finding equilibrium," Journal of Economic Theory, Elsevier, vol. 56(2), pages 400-425, April.
- Stanley Reiter & Carl P. Simon, 1990. "Decentralized Dynamic Processes for Finding Equilibrium," Discussion Papers 865, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Shoven,John B. & Whalley,John, 1992.
"Applying General Equilibrium,"
Cambridge University Press, number 9780521266550, December.
- Chipman, John S., 1974. "Homothetic preferences and aggregation," Journal of Economic Theory, Elsevier, vol. 8(1), pages 26-38, May.
- Shafer, Wayne & Sonnenschein, Hugo, 1993. "Market demand and excess demand functions," Handbook of Mathematical Economics, in: K. J. Arrow & M.D. Intriligator (ed.), Handbook of Mathematical Economics, edition 4, volume 2, chapter 14, pages 671-693 Elsevier.
- Milgrom, Paul & Roberts, John, 1991. "Adaptive and sophisticated learning in normal form games," Games and Economic Behavior, Elsevier, vol. 3(1), pages 82-100, February.
- Muellbauer, John, 1976. "Community Preferences and the Representative Consumer," Econometrica, Econometric Society, vol. 44(5), pages 979-99, September.
- Hildenbrand, Werner, 1983. "On the "Law of Demand."," Econometrica, Econometric Society, vol. 51(4), pages 997-1019, July.
- Alan P. Kirman, 1992. "Whom or What Does the Representative Individual Represent?," Journal of Economic Perspectives, American Economic Association, vol. 6(2), pages 117-136, Spring.
- Wurman, Peter R. & Wellman, Michael P. & Walsh, William E., 2001. "A Parametrization of the Auction Design Space," Games and Economic Behavior, Elsevier, vol. 35(1-2), pages 304-338, April.
- William E. Walsh & Michael P. Wellman, 1999. "Efficiency and Equilibrium in Task Allocation Economics with Hierarchical Dependencies," Working Papers 99-07-049, Santa Fe Institute.
- Eymann, Torsten & Streitberger, Werner & Reinicke, Michael & Freitag, Felix & Chacin, Pablo & Chao, Isaac & Schnizler, Björn & Veit, Daniel, 2007. "Preliminary specification and design documentation for software components to achieve catallaxy in computational systems," Bayreuth Reports on Information Systems Management 2, University of Bayreuth, Chair of Information Systems Management.
- Sandholm, Tuomas W. & Lesser, Victor R., 2001. "Leveled Commitment Contracts and Strategic Breach," Games and Economic Behavior, Elsevier, vol. 35(1-2), pages 212-270, April.
- Kurt Nielsen & Jesper Troelsgaard Nielsen, 2010. "An Allocatively Efficient Auction Market for Payment Entitlements?," MSAP Working Paper Series 03_2010, University of Copenhagen, Department of Food and Resource Economics.
- Nielsen, Kurt, 2005. "Auctioning Payment Entitlements," 2005 International Congress, August 23-27, 2005, Copenhagen, Denmark 24566, European Association of Agricultural Economists.
- Bill Gibson, 2007. "A Multi-Agent Systems Approach to Microeconomic Foundations of Macro," UMASS Amherst Economics Working Papers 2007-10, University of Massachusetts Amherst, Department of Economics.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Guenther Eichhorn) 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.