ScholarGate
Asistent

Porovnat metody

Prohlédněte si vybrané metody vedle sebe; řádky, které se liší, jsou zvýrazněny.

Arrowova-Debreuova rovnováha×Nashova rovnováha×
OborTeorie herTeorie her
RodinaMachine learningMachine learning
Rok vzniku19541950
TvůrceKenneth Arrow, Gerard DebreuJohn Nash
Typalgorithmalgorithm
Původní zdrojArrow, 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 ↗
Další názvyWalrasian Equilibrium, General Equilibrium, Competitive EquilibriumLemke-Howson Equilibrium, Completely Labeled Pair
Příbuzné44
ShrnutíThe 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.
ScholarGateDatová sada
  1. v1
  2. 2 Zdroje
  3. PUBLISHED
  1. v1
  2. 2 Zdroje
  3. PUBLISHED

Přejít na hledání Stáhnout prezentaci

ScholarGatePorovnat metody: Arrow-Debreu Equilibrium · Nash Equilibrium. Získáno 2026-06-19 z https://scholargate.app/cs/compare