In this paper we demonstrate a new method for computing approximate Nash equilibria in n-person games. Strategy spaces are assumed to be represented by simplices, while payoff functions are assumed to be concave. Our procedure relies on a simplicial algorithm that traces paths through the set of...

We study identification in static, simultaneous move finite games of complete information, where the presence of multiple Nash equilibria may lead to partial identification of the model parameters. The identification regions for these parameters proposed in the related literature are known not...

In this paper we consider the nonparametric identification of Markov dynamic games models in which each firm has its own unobserved state variable, which is persistent over time. This class of models includes most models in the Ericson and Pakes (1995) and Pakes and McGuire (1994) framework. We...

The sensitivity of Nash equilibrium to strategic and informational details presents a diØ culty in applying it to games which are not fully specified. Structurally-robust Nash equilibria are less sensitive to such details. More-over, they arrise naturally in important classes of games that have...

This short survey discusses recent findings on the robustness of Nash equilibria of strategic games with many semianonymous players. It describes the notion of structural robustness and its general consequences, as well as implications to particular games, such as ones played on the web and...