首页    期刊浏览 2024年11月13日 星期三
登录注册

文章基本信息

  • 标题:A Conceptually Well-Founded Characterization of Iterated Admissibility Using an "All I Know" Operator
  • 本地全文:下载
  • 作者:Joseph Y. Halpern ; Rafael Pass
  • 期刊名称:Electronic Proceedings in Theoretical Computer Science
  • 电子版ISSN:2075-2180
  • 出版年度:2019
  • 卷号:297
  • 页码:221-232
  • DOI:10.4204/EPTCS.297.15
  • 语种:English
  • 出版社:Open Publishing Association
  • 摘要: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.
国家哲学社会科学文献中心版权所有