Common Belief in Choquet Rationality and Ambiguity Attitudes – Extended Abstract

Adam Dominiak
(Virginia Tech)
Burkhard Schipper
(University of California, Davis)

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.

In Lawrence S. Moss: Proceedings Seventeenth Conference on Theoretical Aspects of Rationality and Knowledge (TARK 2019), Toulouse, France, 17-19 July 2019, Electronic Proceedings in Theoretical Computer Science 297, pp. 140–154.
Published: 19th July 2019.

ArXived at: http://dx.doi.org/10.4204/EPTCS.297.10 bibtex PDF

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org