We define the class of two-player zero-sum games with payoffs having mild discontinuities, which in applications typically stem from how ties are resolved. For games in this class we establish sufficient conditions for existence of a value of the game and minimax or Nash equilibrium strategies...

We define a refinement of Nash equilibria called metastability. This refinement supposes that the given game might be embedded within any global game that leaves its local bestreply correspondence unaffected. A selected set of equilibria is metastable if it is robust against perturbations of...

We impose three conditions on refinements of the Nash equilibria of finite games with perfect recall that select closed connected subsets, called solutions. A. Each equilibrium in a solution uses undominated strategies; B. Each solution contains a quasi-perfect equilibrium; C. The solutions of a...