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
A belief-base semantics for epistemic logic is defined that derives possible worlds from belief bases, enabling a compact universal epistemic model with equivalence results and a complexity bound.
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.
-
Exploiting Belief Bases for Building Rich Epistemic Structures
A belief-base semantics for epistemic logic is defined that derives possible worlds from belief bases, enabling a compact universal epistemic model with equivalence results and a complexity bound.