مقایسهٔ روش‌ها

	رقابت استاکلبرگ	Bayesian Nash Equilibrium
حوزه	نظریه بازی‌ها	نظریه بازی‌ها
خانواده	Machine learning	Machine learning
سال پیدایش	1934	1967
پدیدآور	Heinrich von Stackelberg	John Harsanyi
نوع	algorithm	algorithm
منبع بنیادین	von Stackelberg, H. (1934). Marktform und Gleichgewicht. Julius Springer.	Harsanyi, J. C. (1967). Games with incomplete information played by Bayesian players, Parts I, II, and III. Management Science, 14(3), 159-182.
نام‌های دیگر	Quantity Leadership, Sequential Oligopoly, Stackelberg Equilibrium	BNE, Perfect Bayesian Equilibrium, Type-Contingent Equilibrium
مرتبط	4	4
خلاصه	Stackelberg Competition models sequential oligopolistic markets where one firm (the leader) commits to a quantity first, and other firms (followers) observe this choice and respond. Introduced by Heinrich von Stackelberg in 1934, the model captures first-mover advantage in quantity-setting competition. The resulting Stackelberg Equilibrium, found by backward induction, yields the leader higher profit than simultaneous (Cournot) competition.	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.