विधियों की तुलना करें
चुनी हुई विधियों की आमने-सामने समीक्षा करें; भिन्नता वाली पंक्तियाँ रेखांकित हैं।
| उपखेल पूर्ण संतुलन (Subgame Perfect Equilibrium - SPE)× | नैश संतुलन× | |
|---|---|---|
| क्षेत्र | खेल सिद्धांत | खेल सिद्धांत |
| परिवार | Machine learning | Machine learning |
| उद्भव वर्ष≠ | 1965 | 1950 |
| प्रवर्तक≠ | Reinhard Selten | John Nash |
| प्रकार | algorithm | algorithm |
| मौलिक स्रोत≠ | Selten, R. (1965). Spieltheoretische Behandlung eines Oligopolmodells mit Nachfrageträgheit. Zeitschrift für die gesamte Staatswissenschaft, 121, 301-324. link ↗ | Nash, J. F. (1950). Equilibrium points in N-person games. Proceedings of the National Academy of Sciences, 36(1), 48-49. DOI ↗ |
| उपनाम≠ | Backward Induction, Sequential Equilibrium, Extensive-Form Equilibrium | Lemke-Howson Equilibrium, Completely Labeled Pair |
| संबंधित | 4 | 4 |
| सारांश≠ | Subgame Perfect Equilibrium (SPE) is a refinement of Nash Equilibrium for sequential games, introduced by Reinhard Selten in 1965. It requires that strategy profiles constitute a Nash Equilibrium in every subgame, eliminating non-credible threats and incredible promises. Backward induction is the primary computational method for finding SPE in finite games. | 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डेटासेट ↗ |
|
|