In this paper a procedure is described that computes for a given bimatrix game all stable sets in the sense of Kohlberg and Mertens (1986). Further the procedure is refined to find the strictly perfect equilibria (if any) of such a game. Keywords and Phrases: Bimatrix game, Computation, Stable...

A minimal diversity game is an n player strategic form game in which each player has m pure strategies at his disposal. The payoff to each player is always 1, unless all players select the same pure strategy, in which case all players receive zero payoff. Such a game has a unique isolated...