Incomplete Information And Iterated Strict Dominance

The solution concept of iterated strict dominance for static games with complete information recursively deletes choices that are inferior. Here, we devise such an algorithm for the more general case of incomplete information. The ensuing solution concept of generalized iterated strict dominance is characterized in terms of common belief in rationality as well as in terms of best response sets. Besides, we provide doxastic conditions that are necessary and sufficient for modelling complete information from a one-person perspective.