পদ্ধতির তুলনা করুন

	Stackelberg Competition	ন্যাশ ভারসাম্য
ক্ষেত্র	খেলা তত্ত্ব	খেলা তত্ত্ব
পরিবার	Machine learning	Machine learning
উদ্ভবের বছর	1934	1950
প্রবর্তক	Heinrich von Stackelberg	John Nash
ধরন	algorithm	algorithm
মৌলিক উৎস	von Stackelberg, H. (1934). Marktform und Gleichgewicht. Julius Springer.	Nash, J. F. (1950). Equilibrium points in N-person games. Proceedings of the National Academy of Sciences, 36(1), 48-49.
অপর নাম	Quantity Leadership, Sequential Oligopoly, Stackelberg Equilibrium	Lemke-Howson Equilibrium, Completely Labeled Pair
সম্পর্কিত	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.	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.