This paper is a self-contained survey of algorithms for computing Nash equilibria of two-person games. The games may be given in strategic form or extensive form. The classical Lemke-Howson algorithm finds one equilibrium of a bimatrix game, and provides an elementary proof that a Nash...

Multiplicity of equilibria is a common problem in many economic models. In general, it is impossible to devise methods that always find all equilibria for any type of model. A notable exception are models in which all equilibria are solutions to a system of polynomial equations since there are...