Confronta i metodi

	Teoria dei giochi evolutiva	Equilibrio di Nash
Campo	Teoria dei giochi	Teoria dei giochi
Famiglia	Machine learning	Machine learning
Anno di origine	1973	1950
Ideatore	John Maynard Smith, George Price	John Nash
Tipo	algorithm	algorithm
Fonte seminale	Smith, J. M., & Price, G. R. (1973). The logic of animal conflict. Nature, 246(5427), 15-18.	Nash, J. F. (1950). Equilibrium points in N-person games. Proceedings of the National Academy of Sciences, 36(1), 48-49.
Alias	ESS, Evolutionarily Stable Strategy, Replicator Dynamics	Lemke-Howson Equilibrium, Completely Labeled Pair
Correlati	4	4
Sintesi	Evolutionary Game Theory applies game-theoretic reasoning to biological evolution and social dynamics, where populations of agents with different strategies interact repeatedly. Introduced by John Maynard Smith and George Price in 1973, the framework uses the concept of Evolutionarily Stable Strategies (ESS) to identify strategy distributions that cannot be invaded by mutant strategies. Replicator dynamics describe how strategy frequencies evolve over time when reproduction is proportional to payoff success.	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.