We show that supermodular games satisfying sequential better-reply security possess a pure strategy perfect equilibrium and a strategically stable set of pure strategies. We illustrate that, in continuous supermodular games, perfect equilibria may contain weakly dominated actions. Moreover, in...

We furnish conditions on the primitives of a Bayesian game that guarantee the existence of a Bayes-Nash equilibrium. By allowing for payoff discontinuities in actions, we cover various applications that cannot be handled by extant results.

We prove the existence of a pure-strategy trembling-hand perfect equilibrium in upper semicontinuous potential games, and we show that generic potential games possess pure-strategy strictly perfect and essential equilibria. We also establish a more powerful result: the set of maximizers of an...

We prove the existence of strategically stable sets of pure-strategy Nash equilibria (and hence the existence of pure-strategy trembling-hand perfect equilibria) in potential games that admit an upper semicontinuous potential, and we show that generic potential games possess pure-strategy...

We prove the existence of a pure-strategy trembling-hand perfect equilibrium in upper semicontinuous potential games, and we show that generic potential games possess pure-strategy strictly perfect and essential equilibria. We also establish a more powerful result: the set of maximizers of an...

The recent ellipsoidal method for solving linear programs due to Khachian and Shor is shown to process linear complementarity problems with positive semidefinite matrix. Suitable modifications of all lemmas are presented and it is shown that the algorithm operates in polynomial time of the same...