一个基于“All I Know”算子的迭代可容许性的概念性刻画
A Conceptually Well-Founded Characterization of Iterated Admissibility Using an "All I Know" Operator
摘要:
Brandenburger,Friedenberg和Keisler提供了迭代容许性(IA)的认知特征,也称为弱劣势策略的迭代删除,其中不确定性使用LPS(词典概率序列)表示。它们的特征在一个称为完整结构的丰富结构中保持,其中所有类型都是可能的。在早期的工作中,我们使用“我所知道的一切”算子给出了迭代容许性的特征,该算子捕捉了“代理所知道的一切”的直觉,即代理满足适当的理性假设。这种表征不需要完整的结构,使用的是概率结构,而不是LPS。然而,这种描述并没有解决萨缪尔森对IA的概念性关注,即在较高水平上,参与者不会考虑可能的策略,这些策略被用来证明他们在较低水平上选择策略的合理性。在本文中,我们给出了一个表征IA使用的所有我知道的运营商,不处理萨缪尔森的关注。它使用LPS。然后,我们将展示如何修改的表征使用的概念“近似信念”和“大约所有我知道的”,以便处理萨缪尔森的关注,同时仍然与概率结构。
英文摘要:
Brandenburger, Friedenberg, and Keisler provide an epistemic characterization of iterated admissibility (IA), also known as iterated deletion of weakly dominated strategies, where uncertainty is represented using LPSs (lexicographic probability sequences). Their characterization holds in a rich structure called a complete structure, where all types are possible. In earlier work, we gave a characterization of iterated admissibility using an "all I know" operator, that captures the intuition that "all the agent knows" is that agents satisfy the appropriate rationality assumptions. That characterization did not need complete structures and used probability structures, not LPSs. However, that characterization did not deal with Samuelson's conceptual concern regarding IA, namely, that at higher levels, players do not consider possible strategies that were used to justify their choice of strategy at lower levels. In this paper, we give a characterization of IA using the all I know operator that does deal with Samuelson's concern. However, it uses LPSs. We then show how to modify the characterization using notions of "approximate belief" and "approximately all I know" so as to deal with Samuelson's concern while still working with probability structures.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。