Answers are grounded in this paper and cite their sources.
We study finite-player normal-form games with compact metric action spaces and bounded Borel measurable payoffs, which need not be continuous. Our main theorem shows that every Nash equilibrium of such a game can be recovered as the limit, in the product weak topology, of ε ₙ ε n -Nash equilibria of finite restrictions of the game, where ε ₙ↓ 0 ε n ↓ 0 and each restriction discretizes the action spaces without changing payoffs. For each player, the finite action sets become dense in the original action space, and the approximating sequence may depend on the prescribed equilibrium. The proof samples from the prescribed equilibrium and uses concentration inequalities to select a realization that approximates it while nearly satisfying all players’ incentive constraints simultaneously. A uniformly vanishing payoff perturbation also makes the constructed profiles exact Nash equilibria of nearby finite games. We provide an example of a continuous game showing that exact equilibria of the unperturbed finite restrictions need not suffice: the game has a Nash equilibrium that is not the limit of Nash equilibria along any sequence of such restrictions.
No takes yet. Share an insight, caveat, or question.
Francesc Dilmé (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: