arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1811.01933econ.TH
收藏

用不完全信息刻画可容许性、真可容许性和迭代可容许性

Characterizing Permissibility, Proper Rationalizability, and Iterated Admissibility by Incomplete Information

Shuige Liu

摘要:

我们描述了认知博弈论中三个相互关联的概念:允许性,适当合理化,和迭代容许性。我们定义了一个不完全信息博弈的字典式认知模型。在此基础上,我们给出了两组刻画。第一组的特点是允许性和适当的合理化。第二组特征的另一种方式和迭代的可容许性。在每一组中,后者的条件比前者的条件更强,这对应于这样一个事实,即真有理化性和迭代容许性是完全信息框架内容许性的两个(相容的)精化。这两个群体之间的内在区别是理性的作用:第一个群体不需要理性,而第二个群体需要理性。

英文摘要:

We characterize three interrelated concepts in epistemic game theory: permissibility, proper rationalizability, and iterated admissibility. We define the lexicographic epistemic model for a game with incomplete information. Based on it, we give two groups of characterizations. The first group characterizes permissibility and proper rationalizability. The second group characterizes permissibility in an alternative way and iterated admissibility. In each group, the conditions for the latter are stronger than those for the former, which corresponds to the fact that proper rationalizability and iterated admissibility are two (compatible) refinements of permissibility within the complete information framework. The intrinsic difference between the two groups are the role of rationality: the first group does not need it, while the second group does.

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

↑