We provide here an epistemic analysis of arbitrary strategic games based on the possibility correspondences. Such an analysis calls for the use of transfinite iterations of the corresponding operators. Our approach is based on Tarski’s Fixpoint Theorem and applies both to the notions of rationalizability and the iterated elimination of strictly dominated strategies.

D. Samet (Dov)
Biannual Conference on Theoretical Aspects of Rationalism and Knowledge
Networks and Optimization

Apt, K. (2007). Epistemic Analysis of Strategic Games with Arbitrary Strategy Sets. In D. Samet (Ed.), Proceedings of the 11th conference on theoretical aspects of rationality and knowledge (pp. 25–32). A.C.M.