The Complexity of Exchange
The computational complexity of two classes of market mechanisms is compared. First the Walrasian interpretation in which prices are centrally computed by an auctioneer. Recent results on the "computational complexity" are reviewed. The "non"-"polynomial complexity" of these algorithms makes Walrasian general equilibrium an "implausible" conception. Second, a "decentralised" picture of market processes is described, involving concurrent exchange within transient coalitions of agents. These processes feature "price dispersion", yield allocations that are "not in the core", modify the "distribution of wealth", are always "stable", but "path"-"dependent." Replacing the Walrasian framing of markets requires substantial revision of conventional wisdom concerning markets. Copyright 2005 Royal Economic Society.
If 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.
Volume (Year): 115 (2005)
Issue (Month): 504 (06)
|Contact details of provider:|| Postal: |
Phone: +44 1334 462479
Web page: http://www.res.org.uk/
More information through EDIRC
|Order Information:||Web: http://www.blackwellpublishers.co.uk/asp/journal.asp?ref=0013-0133|
When requesting a correction, please mention this item's handle: RePEc:ecj:econjl:v:115:y:2005:i:504:p:f193-f210. 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: (Wiley-Blackwell Digital Licensing)or (Christopher F. Baum)
If references are entirely missing, you can add them using this form.