On Stalnaker's Notion of Strong Rationalizability and Nash Equilibrium in Perfect Information Games

Counterexamples to two results by Stalnaker (Theory and Decision, 1994) are given and a corrected version of one of the two results is proved. Stalnaker's proposed results are: (1) if at the true state of an epistemic model of a perfect information game there is common belief in the rationality of every player and common belief that no player has false beliefs (he calls this joint condition strong rationalizability), then the true (or actual) strategy profile is path equivalent to a Nash equilibrium; (2) in a normal-form game a strategy profile is strongly rationalizable if and only if it belongs to C , the set of profiles that survive the iterative deletion of inferior profiles.