Level-k Reasoning, Cognitive Hierarchy, and Rationalizability

We use a uniform framework to give Camerer, Ho, and Chong's (2004) cognitive hierarchy (CH) solution and its dynamic extension a decision-theoretical foundation by the epistemic game theoretical solution concept Δ-rationalizability (Battigalli and Siniscalchi, 2003). We interpret level-k strategic sophistication as an information type and define restriction Δ^κ on information types; based on it, we show that in the behavioral consequence of rationality, common belief in rationality and transparency, called Δ^κ-rationalizability, the levels of reasoning is endogenously determined. We show that in static games, CH solution generically coincides with Δ^κ-rationalizability; based on this, we connect CH with Bayesian equilibrium. By adapting Δ^κ into dynamic games, we show that Lin and Palfrey's (2024) DCH solution generically coincides with the behavioral consequence of rationality, common strong belief in rationality, and transparency of (dynamic) Δ^κ. The same framework could also be used to analyze many variations of CH in the literature.