Chargement en cours…

Can markets compute equilibria? /

Recent turmoil in financial and commodities markets has renewed questions regarding how well markets discover equilibrium prices, particularly when those markets are highly complex. A relatively new critique questions whether markets can realistically find equilibrium prices if computers cannot. For...

Description complète

Détails bibliographiques
Cote:Libro Electrónico
Auteur principal: Monroe, Hunter K. (Auteur)
Collectivité auteur: International Monetary Fund
Format: Électronique eBook
Langue:Inglés
Publié: [Washington, D.C.] : International Monetary Fund, 2009.
Collection:IMF working paper ; WP/09/24.
Sujets:
Accès en ligne:Texto completo
Table des matières:
  • I. Introduction; II. Is Computing Equilibria Difficult?; Table; 1. Payoff Matrix for the Prisoner's Dilemma; Figures; 1. NP-complete: Is there a Hamilton Cycle?; 2. P: Is this a Hamilton Cycle?; III. Are There Natural Problems with No Best Algorithm?; A. Superlinear vs. Blum Speedup; B. No Best Algorithm for Integer and Matrix Multiplication?; 3. Boolean circuit: Are at least two inputs "TRUE"?; C. The Power of Cancellation; D. No Best Algorithm for coNP-Complete Problems?; E. No Best Algorithm Versus No Algorithm at All; IV. Conclusion; 4. Is speedup inherited?; References