期刊名称：Electronic Proceedings in Theoretical Computer Science
电子版ISSN：2075-2180
出版年度：2019
卷号：297
页码：140-154
DOI：10.4204/EPTCS.297.10
语种：English
出版社：Open Publishing Association
摘要：We consider finite games in strategic form with Choquet expected utility. Using the notion of (unambiguously) believed, we define Choquet rationalizability and characterize it by Choquet rationality and common beliefs in Choquet rationality in the universal capacity type space in a purely measurable setting. We also show that Choquet rationalizability is equivalent to iterative elimination of strictly dominated actions (not in the original game but) in an extended game. This allows for computation of Choquet rationalizable actions without the need to first compute Choquet integrals. Choquet expected utility allows us to investigate common belief in ambiguity love/aversion. We show that ambiguity love/aversion leads to smaller/larger Choquet rationalizable sets of action profiles.
