We provide an epistemic analysis of arbitrary strategic games based on possibility correspondences. Such an analysis calls for the use of transfinite iterations of the corresponding operators. In the case of common beliefs and common knowledge our approach is based on Tarski’s Fixpoint Theorem and applies to ‘monotonic’ properties. In the case of an analysis based on the notion of a public announcement our approach applies to ‘global properties’. Both classes of properties include the notions of rationalizability and the iterated elimination of strictly dominated strategies. We also provide an axiomatic presentation of the main results concerning common beliefs and monotonic properties.
Krzysztof R. Apt, Jonathan A. Zvesper