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.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. 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) Pages: F193-F210 Download reference. The following formats are available: HTML
(with abstract),
plain text
(with abstract),
BibTeX,
RIS (EndNote, RefMan, ProCite),
ReDIF
For technical questions regarding this item, or to correct its listing, contact: (Christopher F. Baum).
Related research
Keywords:
Cited by: (explanations, 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.)