Iterated admissibility embodies a minimal criterion of rationality in interactions. The epistemic characterization of this solution has been actively investigated in recent times: it has been shown that strategies surviving $$m+1$$ m + 1 rounds of iterated admissibility may be identified as those that are obtained under a condition called rationality and m assumption of rationality in complete lexicographic type structures. On the other hand, it has been shown that its limit condition, with an infinity assumption of rationality ( $$R\infty AR$$ R ∞ A R ), might not be satisfied by any state in the epistemic structure, if the class of types is complete and the types are continuous. In this paper we analyze the problem in a different framework. We redefine the notion of type as well as the epistemic notion of assumption . These new definitions are sufficient for the characterization of iterated admissibility as the class of strategies that indeed satisfy $$R\infty AR$$ R ∞ A R . One of the key methodological innovations in our approach involves defining a new notion of generic types and employing these in conjunction with Cohen’s technique of forcing .

中文翻译：

---

通过战略信念模型中的强制迭代可接纳性

迭代可接受性体现了交互中合理性的最低标准。最近对该解决方案的认知特征进行了积极的研究：已经表明，在 $$m+1$$m + 1 轮迭代可接受性中幸存下来的策略可以识别为在称为合理性和 m 的条件下获得的策略完全词典类型结构中的合理性假设。另一方面，已经表明，它的极限条件，具有无限合理性假设（ $$R\infty AR$$ R ∞ AR ），可能不会被认知结构中的任何状态满足，如果类型是完整的，类型是连续的。在本文中，我们在不同的框架中分析问题。我们重新定义了类型的概念以及假设的认知概念。这些新定义足以将迭代可接受性表征为确实满足 $$R\infty AR$$ R ∞ AR 的策略类别。我们方法中的关键方法创新之一涉及定义泛型类型的新概念，并将这些概念与 Cohen 的强迫技术结合使用。