Characterizing permissibility, proper rationalizability, and iterated admissibility by incomplete information

研究成果: Article査読

抄録

We characterize three interrelated solution concepts in epistemic game theory: permissibility, proper rationalizability, and iterated admissibility. We define the lexicographic epistemic model in a framework with incomplete information. Based on it, we give two groups of conditions; one characterizes permissibility and proper rationalizability, the other 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 incomparable but compatible refinements of permissibility within the complete information framework. The essential difference between the two groups is whether a full belief of rationality is needed.

本文言語English
ページ(範囲)119-148
ページ数30
ジャーナルInternational Journal of Game Theory
50
1
DOI
出版ステータスPublished - 2021 3

ASJC Scopus subject areas

  • 統計学および確率
  • 数学(その他)
  • 社会科学(その他)
  • 経済学、計量経済学
  • 統計学、確率および不確実性

フィンガープリント

「Characterizing permissibility, proper rationalizability, and iterated admissibility by incomplete information」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル