विधियों की तुलना करें
चुनी हुई विधियों की आमने-सामने समीक्षा करें; भिन्नता वाली पंक्तियाँ रेखांकित हैं।
| बाइसेशियन नैश इक्विलिब्रियम (Bayesian Nash Equilibrium)× | नैश संतुलन× | |
|---|---|---|
| क्षेत्र | खेल सिद्धांत | खेल सिद्धांत |
| परिवार | Machine learning | Machine learning |
| उद्भव वर्ष≠ | 1967 | 1950 |
| प्रवर्तक≠ | John Harsanyi | John Nash |
| प्रकार | algorithm | algorithm |
| मौलिक स्रोत≠ | Harsanyi, J. C. (1967). Games with incomplete information played by Bayesian players, Parts I, II, and III. Management Science, 14(3), 159-182. DOI ↗ | Nash, J. F. (1950). Equilibrium points in N-person games. Proceedings of the National Academy of Sciences, 36(1), 48-49. DOI ↗ |
| उपनाम≠ | BNE, Perfect Bayesian Equilibrium, Type-Contingent Equilibrium | Lemke-Howson Equilibrium, Completely Labeled Pair |
| संबंधित | 4 | 4 |
| सारांश≠ | Bayesian Nash Equilibrium (BNE) extends Nash Equilibrium to games with incomplete information, where players lack full knowledge of others' payoff functions. Introduced by John Harsanyi in 1967, BNE models strategic interaction under uncertainty by representing unknown payoffs as players' private types drawn from a probability distribution. Equilibrium is found by solving for type-contingent strategies that are best responses to all possible type realizations. | 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डेटासेट ↗ |
|
|