Lexicographic Strong Belief and Perfect Extensive-Form Rationalizability

辭典式強信念與完美展開形式可合理化

楊智鈞(Chih-Chun Yang)

《經濟論文》 48卷1期 (2020/03) Pp. 1-31

摘要

Within the framework of lexicographic probability systems (LPS's), we propose the notion of lexicographic strong belief. Perfect lexicographic extensive-form rationalizability (PLEFR) is defined by perfect rationality and common lexicographic strong belief of perfect rational strategies. We show Yang's (2018) perfect extensive-form rationalizability (PEFR) is equivalent to PLEFR.

關鍵字

Lexicographic strong belief ； Perfect lexicographic extensive-form rationalizability ； Perfect extensive-form rationalizability ； Lexicographic probability system

並列摘要

在辭典式機率系統的架構下，我們提出辭典式強信念此一概念。完美辭典式展開形式可合理化則定義成完美理性與共同辭典式強信念完美理性策略。我們證明Yang（2018）的完美展開形式可合理化與之等價。

並列關鍵字

辭典式強相信 ； 完美展開形式可合理化 ； 完美辭典式展開形式可合理化 ； 辭典式機率系統

參考文獻

Asheim, G. B. and A. Perea (2005), “Sequential and Quasi-Perfect Rationalizability in Extensive Games,” Games and Economic Behavior, 53, 15–42.

Battigalli, P. (1996), “Strategic Rationality Orderings and the Best Rationalization Principle,” Games and Economic Behavior, 13, 178–200.

Battigalli, P. (1997), “On Rationalizability in Extensive Games,” Journal of Economic Theory, 74(1), 40–61.

Battigalli, P. and M. Siniscalchi (2002), “Strong Belief and Forward Induction Reasoning,” Journal of Economic Theory, 106(2), 356–391.

Bernheim, D. (1984), “Rationalizable Strategic Behavior,” Econometrica, 52(4), 1007–1028.