قارن الطرق
راجع الطرق التي اخترتها جنبًا إلى جنب؛ الصفوف المختلفة مميَّزة.
| توازن السهم-دبرو× | توازن ناش (Nash Equilibrium)× | |
|---|---|---|
| المجال | نظرية الألعاب | نظرية الألعاب |
| العائلة | Machine learning | Machine learning |
| سنة النشأة≠ | 1954 | 1950 |
| صاحب الطريقة≠ | Kenneth Arrow, Gerard Debreu | John Nash |
| النوع | algorithm | algorithm |
| المصدر التأسيسي≠ | 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 ↗ |
| الأسماء البديلة≠ | Walrasian Equilibrium, General Equilibrium, Competitive Equilibrium | Lemke-Howson Equilibrium, Completely Labeled Pair |
| ذات صلة | 4 | 4 |
| الملخص≠ | 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. |
| ScholarGateمجموعة البيانات ↗ |
|
|