On Strictly Perfect Sets

It is shown that for a bimatrix game the set of extreme equilibria is a strictly perfect set and that every minimal strictly perfect set is finite. Moreover, it is proved that there are finitely many equivalence classes of minimal strictly perfect sets, each of which can be associated with a collection of faces of maximal Nash subsets for the game. Further, it is shown that the set of strictly perfect equilibria, if non-empty, is the finite union of faces of maximal Nash subsets. Journal of Economic Literature Classification Number: C72