We show that Nash equilibrium components are universal for the collection of connected polyhedral sets. More precisely for every polyhedral set we construct a so-called binary game—a game where all players have two pure strategies and a common utility function with values either zero or...

We show that Nash equilibrium components are universal for the collection of connected polyhedral sets. More precisely for every polyhedral set we construct a so-called binary game — a common interest game whose common payoff to the players is at most equal to one—whose success set (the set...

Hillas (1990) introduced a definition of strategic stability based on perturbations of the best reply correspondence that satisfies all of the requirements given by Kohlberg and Mertens (1986). Hillas et al. (2001) point out though that the proofs of the iterated dominance and forward induction...