英文摘要 |
Within the framework of lexicographic probability systems (LPS’s), we propose thenotion 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. |