Porównaj metody

	Konkurencja Cournota	Równowaga Nasha
Dziedzina	Teoria gier	Teoria gier
Rodzina	Machine learning	Machine learning
Rok powstania	1838	1950
Twórca	Augustin-Louis Cournot	John Nash
Typ	algorithm	algorithm
Źródło pierwotne	Cournot, A. A. (1838). Recherches sur les principes mathématiques de la théorie des richesses. L. Hachette.	Nash, J. F. (1950). Equilibrium points in N-person games. Proceedings of the National Academy of Sciences, 36(1), 48-49.
Inne nazwy	Quantity Competition, Cournot Equilibrium, Cournot-Nash Equilibrium	Lemke-Howson Equilibrium, Completely Labeled Pair
Pokrewne	4	4
Podsumowanie	Cournot Competition models oligopolistic markets where firms choose quantities simultaneously, not prices. Originally formulated by Augustin-Louis Cournot in 1838, the model assumes each firm's profit depends on the total market quantity produced. The resulting Cournot-Nash Equilibrium captures the strategic interaction where each firm maximizes profit given competitors' quantities, leading to prices between monopoly and perfect competition levels.	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.