Abstract
This paper provides two conditions of epistemic robustness, robustness to alternative best replies and robustness to non-best replies, and uses them to characterize variants of curb sets in finite games, including the set of rationalizable strategies.