Publication Date: March 1998
Revision Date: July 1998
Two approaches have been proposed in the literature to reﬁne the rationalizability solution concept: either assuming that players make small errors when playing their strategies, or assuming that their is a small amount of payoﬀ uncertainty. We show that both approaches lead to the same reﬁnement if errors are made according to the concept of weakly perfect rationalizability, and there is payoﬀ uncertainty as in Dekel and Fudenberg [Journal of Economic Theory (1990), 52: 243–267]. For both cases, the strategies that survive are obtained by starting with one round of elimination of weakly dominated strategies followed by many rounds of elimination of strictly dominated strategies.
Published in Economic Theory (May 2000), 15(2): 677-687 [JSTOR]