Belief-free rationalizability and informational robustness.

We propose an incomplete information version of rationalizability. An action is said to be belief-free rationalizable if it survives the following iterated deletion process. At each stage, we delete actions for a type of a player that are not a best response to some conjectures of the player. The conjecture has to put positive weight only on states, and types and actions of the other players which that type thinks possible, and actions of those types that have survived so far. We analyze some economic applications under this solution concept.