A refinement of the set of Nash equilibria that satisfies two assumptions is shown to select a subset that is stable in the sense defined by Kohlberg and Mertens. One assumption requires that a selected set is invariant to adjoining redundant strategies and the other is a strong version of...

We provide a shorter proof of the main result in Reny and Perry (2006, Econometrica) by establishing a lower semicontinuity property of auctions as the number of traders goes to infinity, leveraging existence of equilibria in the limit auction. Our proof also eliminates two of the assumptions in...

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