The complexity of exchange

被引:65
作者
Axtell, R [1 ]
机构
[1] Brookings Inst, Washington, DC 20036 USA
关键词
D O I
10.1111/j.1468-0297.2005.01001.x
中图分类号
F [经济];
学科分类号
02 ;
摘要
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.
引用
收藏
页码:F193 / F210
页数:18
相关论文
共 38 条
[1]  
ALBIN P, 1990, J ECON BEHAV ORGAN, V18, P27
[2]  
[Anonymous], 1973, The Computation of Economic Equilibria
[3]  
[Anonymous], LIMITS KNOWLEDGE EC
[4]  
Arrow KJ, 1971, General Competitive Analysis
[5]  
Arthur W. B., 1997, EC COMPLEX EVOLVING
[6]  
BELL AM, 1997, 97W08 VAND U
[7]  
Bertsekas Dimitri P., 1989, PARALLEL DISTRIBUTED
[8]   ACCESSIBILITY OF PARETO-OPTIMA BY WALRASIAN EXCHANGE PROCESSES [J].
BOTTAZZI, JM .
JOURNAL OF MATHEMATICAL ECONOMICS, 1994, 23 (06) :585-603
[9]   Decentralized computation procurement and computational robustness in a smart market [J].
Brewer, PJ .
ECONOMIC THEORY, 1999, 13 (01) :41-92
[10]  
CHEN SH, 1997, EVOLUTIONARY PROGRAM, V6