ScholarGate
Asistent

Compară metode

Examinează metodele selectate una lângă alta; rândurile care diferă sunt evidențiate.

Echilibrul Arrow-Debreu×Echilibrul Nash×
DomeniuTeoria jocurilorTeoria jocurilor
FamilieMachine learningMachine learning
Anul apariției19541950
Autorul originalKenneth Arrow, Gerard DebreuJohn Nash
Tipalgorithmalgorithm
Sursa seminalăArrow, K. J., & Debreu, G. (1954). Existence of an equilibrium for competitive economies. Econometrica, 22(3), 265-290. DOI ↗Nash, J. F. (1950). Equilibrium points in N-person games. Proceedings of the National Academy of Sciences, 36(1), 48-49. DOI ↗
Denumiri alternativeWalrasian Equilibrium, General Equilibrium, Competitive EquilibriumLemke-Howson Equilibrium, Completely Labeled Pair
Înrudite44
RezumatThe Arrow-Debreu model is a general equilibrium framework where prices adjust to clear all markets simultaneously, and consumers and firms optimize given those prices. Introduced by Kenneth Arrow and Gerard Debreu in 1954, the model extends Adam Smith's invisible hand concept into a rigorous mathematical framework. Arrow-Debreu equilibrium proves existence, uniqueness (under certain conditions), and Pareto efficiency of competitive equilibria.Nash Equilibrium is a game-theoretic solution concept where no player can unilaterally deviate to improve their payoff. Formalized by John Nash in 1950, the Lemke-Howson algorithm computationally finds equilibria in bimatrix games by identifying completely labeled vertex pairs in the strategy polytopes.
ScholarGateSet de date
  1. v1
  2. 2 Surse
  3. PUBLISHED
  1. v1
  2. 2 Surse
  3. PUBLISHED

Mergi la căutare Descarcă prezentarea

ScholarGateCompară metode: Arrow-Debreu Equilibrium · Nash Equilibrium. Preluat la 2026-06-19 de pe https://scholargate.app/ro/compare