We study (interim correlated) rationalizability in a game with incomplete information. We characterize the recursive set of possible rationalizable hierarchies through a finite automaton and provide a revelation principle that characterizes the distributions over these hierarchies that arise...

We study a simultaneous, complete-information game played by p = 1 P agents. Each p has an ordinal decision variable Y p ∈ A p ={ 0 1 M p} , where M p can be unbounded, A p is p’s action space, and each element in A p is an action , that is, a potential value for Y p . The collective action...