Choquet rationalizability is characterized by common belief in Choquet rationality, equals IESDA in an extended game, and shrinks or grows with ambiguity love or aversion.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.GT 2years
2019 2verdicts
UNVERDICTED 2representative citing papers
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.
citing papers explorer
-
Common Belief in Choquet Rationality and Ambiguity Attitudes -- Extended Abstract
Choquet rationalizability is characterized by common belief in Choquet rationality, equals IESDA in an extended game, and shrinks or grows with ambiguity love or aversion.
-
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.