Equilibrium selection in games: the mollifier method.

This paper introduces an embedding of a Nash equilibrium into a sequence of perturbed games, which achieves continuous differentiability of best responses by mollifying them over a continuously differentiable density with compact support (window size). Along any sequence with shrinking window size, the equilibria are single-valued whenever the function has a regular Jacobian and the set of equilibria where it is singular has measure zero. We achieve a further reduction of the equilibrium set by inserting within the embedding a procedure that eliminates the strict interior of equilibrium sets. The mollifier can be approximated consistently using kernel density regression, and we sketch a non-stationary stochastic optimization algorithm that uses this approximation and converges with probability one to an equilibrium of the original game. © 2003 Elsevier B.V. All rights reserved.