Σύγκριση μεθόδων

	Ανταγωνισμός Stackelberg	Ισορροπία Nash
Πεδίο	Θεωρία Παιγνίων	Θεωρία Παιγνίων
Οικογένεια	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.