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...

Purpose - The purpose of this paper is to study the Hölder calmness of solutions to equilibrium problems and apply it to economics. Design/methodology/approach - The authors obtain the Hölder calmness by using an effective approach. More precisely, under the key assumption of strong convexity,...