The literature on the computation of Nash equilibria in n-person games is dominated by simplicial methods. This paper is the first to introduce a globally convergent algorithm that fully exploits the differentiability present in the problem. It presents an everywhere differentiable homotopy to...

We apply the dynamic stochastic framework proposed in recent evolutionary literature to a class of coordination games played simultaneously by the entire population. In these games payoffs, and hence best replies, are determined by a summary statistic of the population strategy profile. We...

We introduce strategic waiting in a global game setting with irreversible investment. Players can wait in order to make a better informed decision. We allow for cohort effects, which arise endogenously in technology adoption problems with positive contemporaneous network effects. Formally,...

The paper explores a model of equilibrium selection in coordination games, where agents from an infinite population stochastically adjust their strategies to changes in their local environment. Instead of playing perturbed best-response, it is assumed that agents follow a rule of `switching to...

This paper studies the extent to which diffusion approximations provide a reliable guide to equilibrium selection results in finite games. It is shown that they do for a class of finite games with weak learning provided that limits are taken in a certain order. The paper also shows that making...