By a player splitting we mean a mechanism that distributes the information sets of a player among so-called agents. A player splitting is called independent if each path in the game tree contains at most one agent of every player. Following Mertens (1989), a solution is said to have the player...

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...