Characterizes iterated admissibility via the 'all I know' operator, first with LPSs to address Samuelson's concern and then with approximate belief and approximate 'all I know' in standard probability structures.
Lo (1999): Nash equilibrium without mutual knowledge of rationality
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.GT 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A Conceptually Well-Founded Characterization of Iterated Admissibility Using an "All I Know" Operator
Characterizes iterated admissibility via the 'all I know' operator, first with LPSs to address Samuelson's concern and then with approximate belief and approximate 'all I know' in standard probability structures.