Resumen
Nash equilibrium, introduced in the 1950s, is the main concept used in the analysis of strategic games. Computing a Nash equilibrium of an arbitrary n-person non-cooperative game with many individual strategies is at least as difficult as any problem that belongs to the class of PPAD-complete problems believed, and is considered too difficult for practical computations. It is argued that a game designed to defeat an algorithm is not likely to be natural in applications. As a result, there have been alternative approaches and conclusions to the question of computing a Nash equilibrium in games with many strategies. There are positive results on computing -- with a high probability -- an equilibrium of a many-strategies randomly generated game.