Monotone continuous multiple priors
We show that the monotone continuity condition introduced by Arrow (1970) is the behavioral counterpart of countable additivity and weak compactness of the set of priors in a maxmin expected utility model. This generalizes Arrow's original result, who considered the special case of a singleton set of priors. Several other convenient technical properties of the set of priors, like non-atomicity, are studied and their behavioral counterparts are provided.
|Date of creation:||2005|
|Date of revision:|
|Note:||View the original document on HAL open archive server: https://halshs.archives-ouvertes.fr/halshs-00177057|
|Contact details of provider:|| Web page: https://hal.archives-ouvertes.fr/|
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Massimo Marinacci & Luigi Montrucchio, 2005. "Stable cores of large games," International Journal of Game Theory, Springer, vol. 33(2), pages 189-213, 06.
When requesting a correction, please mention this item's handle: RePEc:hal:cesptp:halshs-00177057. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (CCSD)
If references are entirely missing, you can add them using this form.