Machine learningGame-theoretic

Bayesian Nash Equilibrium

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.

MethodMind'de açSoonVideoSoon

Tam yöntemi oku

Members only

Sign in with a free account to read this section.

Sign in

Sources

  1. Harsanyi, J. C. (1967). Games with incomplete information played by Bayesian players, Parts I, II, and III. Management Science, 14(3), 159-182. DOI: 10.1287/mnsc.14.3.159
  2. Harsanyi, J. C. (1968). Games with incomplete information played by Bayesian players. Management Science, 14(7), 486-502. DOI: 10.1287/mnsc.14.7.486

Related methods

Referenced by

ScholarGateBayesian Nash Equilibrium (Bayesian Nash Equilibrium with Incomplete Information). Retrieved 2026-06-04 from https://scholargate.app/tr/game-theory/bayesian-nash-equilibrium