We define a concept of epistemic robustness in the context of an epistemic model of a finite normal-form game where a player type corresponds to a belief over the profiles of opponent strategies and types. A Cartesian product X of pure-strategy subsets is epistemically robust if there is a...

Battigalli and Siniscalchi (2002) formalize the idea of forward induction reasoning as "rationality and common strong belief of rationality" (RCSBR). Here, we study the behavioral implications of RCSBR across all type structures. Formally, we show that RCSBR is characterized by a solution...

Type structures are a simple device to describe higher-order beliefs. However, how can we check whether two types generate the same belief hierarchy? This paper generalizes the concept of a type morphism and shows that one type structure is contained in another if and only if the former can be...

The epistemic conditions of rationality and mth-order strong belief of rationality (RmSBR; Battigalli and Siniscalchi, 2002) formalize the idea that players engage in contextualized forward-induction reasoning. This paper characterizes the behavior consistent with RmSBR across all type...

We define and analyze a "strategic topology'' on types in the Harsanyi-Mertens-Zamir universal type space, where two types are close if their strategic behavior is similar in all strategic situations. For a fixed game and action define the distance between a pair of types as the difference...

This paper proposes the solution concept of interim correlated rationalizability, and shows that all types that have the same hierarchies of beliefs have the same set of interim-correlated-rationalizable outcomes. This solution concept characterizes common certainty of rationality in the...

Rationalizable partition-confirmed equilibrium (RPCE) describes the steady state outcomes of rational learning in extensive-form games, when rationality is common knowledge and players observe a partition of the terminal nodes. RPCE allows players to make inferences about unobserved play by...

A learning rule is uncoupled if a player does not condition his strategy on the opponent's payoffs. It is radically uncoupled if a player does not condition his strategy on the opponent's actions or payoffs. We demonstrate a family of simple, radically uncoupled learning rules whose...

We investigate strategic information transmission with communication error, or noise. Our main finding is that adding noise can improve welfare. With quadratic preferences and a uniform type distribution, welfare can be raised for almost every bias level by introducing a sufficiently small...

This paper analyzes multi-sender cheap talk when the state space might be restricted, either because the policy space is restricted, or the set of rationalizable policies of the receiver is not the whole space. We provide a necessary and sufficient condition for the existence of a fully...