Transparent Restrictions on Beliefs and Forward Induction Reasoning in Games with Asymmetric Information

We analyze forward-induction reasoning in games with asymmetric information assuming some commonly understood restrictions on beliefs. Specifically, we assume that some given restrictions ? on players' initial or conditional first-order beliefs are transparent, that is, not only the restrictions ? hold, but there is common belief in ? at every node. Most applied models of asymmetric information are covered as special cases whereby ? pins down the probabilities initially assigned to states of nature. But the abstract analysis also allows for transparent restrictions on beliefs about behavior, e.g. independence restrictions or restrictions induced by the context behind the game. Our contribution is twofold. First, we use dynamic interactive epistemology to formalize assumptions that capture foward-induction reasoning given the transparency of ?, and show that the behavioral implications of these assumptions are characterized by the ?-rationalizability solution procedure of Battigalli (1999, 2003). Second, we study the differences and similarities between this solution concept and a simpler solution procedure put forward by Battigalli and Siniscalchi (2003). We show that the two procedures are equivalent if ? is "closed under compositions", a property that holds in all the applications considered by Battigalli and Siniscalchi (2003). We also show that when ? is not closed under compositions the simpler solution procedure may fail to characterize the behavioral implications of forward induction reasoning. J.E.L. Classification Numbers: C72, C73, D82. KEYWORDS: Epistemic game theory, Rationalizability, Forward induction, Transparent restrictions on beliefs.