It is shown that the perfect and the proper equilibria for 2×n bimatrix games can be determined systematically by means of the geometric-combinatorial approach of Borm et al. Moreover, for these games, stable sets and persistent retracts can be characterized. In particular, it is found that each stable set consists of either one or two perfect equilibria, that each stable component contains a proper equilibrium and that each persistent equilibrium is perfect.
