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 such games, we establish sufficient conditions for existence of a value of the game, maximin and minimax strategies for the players,...

A player's pure strategy is called relevant for an outcome of a game in extensive form with perfect recall if there exists a weakly sequential equilibrium with that outcome for which the strategy is an optimal reply at every information set it does not exclude. The outcome satisfies forward...

Consider nonempty finite pure strategy sets S[subscript 1], . . . , S[subscript n], let S = S[subscript 1] times . . . times S[subscript n], let Omega be a finite space of "outcomes," let Delta(Omega) be the set of probability distributions on Omega, and let theta: S approaches Delta(Omega) be a...

For each two-player game, a linear-programming algorithm finds a component of the Nash equilibria and a subset of its perfect equilibria that are simply stable in the sense that there are nearby equilibria for each nearby game that perturbs one strategy's probability or payoff more than others....