arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0906.4326cs.AIcs.GTcs.LO
收藏

迭代可容许性的逻辑刻画

A Logical Characterization of Iterated Admissibility

Cornell University(康奈尔大学)

Joseph Y. Halpern, Rafael Pass

摘要:

Brandenburger,Friedenberg和Keisler提供了迭代可接受性的认识论特征(即,弱劣势策略的迭代删除),其中不确定性使用LPS(词典概率序列)表示。它们的特征在一个称为完整结构的丰富结构中保持,其中所有类型都是可能的。本文给出了迭代容许性的一个逻辑特征,它只涉及标准概率,并且不仅适用于完备结构,而且适用于所有结构。一个更强的概念,强容许性,然后定义。粗略地说,强可容许性是为了捕捉这样一种直觉,即“代理人所知道的一切”是其他代理人满足适当的理性假设。强可容许性使得可容许性、规范结构(典型地在模态逻辑的完备性证明中考虑)、完备结构和“我所知道的一切”的概念之间的关系成为可能。

英文摘要:

Brandenburger, Friedenberg, and Keisler provide an epistemic characterization of iterated admissibility (i.e., 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. Here, a logical charaacterization of iterated admisibility is given that involves only standard probability and holds in all structures, not just complete structures. A stronger notion of strong admissibility is then defined. Roughly speaking, strong admissibility is meant to capture the intuition that "all the agent knows" is that the other agents satisfy the appropriate rationality assumptions. Strong admissibility makes it possible to relate admissibility, canonical structures (as typically considered in completeness proofs in modal logic), complete structures, and the notion of ``all I know''.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑