Universal interactive preferences
We prove that a universal preference type space exists under much more general conditions than those postulated by Epstein and Wang (1996). To wit, it is enough that preferences can be encoded by a countable collection of continuous functionals, while the preferences themselves need not necessarily be continuous or regular, like, e.g., in the case of lexicographic preferences. The proof relies on a far-reaching generalization of a method developed by Heifetz and Samet (1998).
|Date of creation:||13 Nov 2012|
|Date of revision:|
|Contact details of provider:|| Postal: |
Web page: http://www.essex.ac.uk/economics/
More information through EDIRC
|Order Information:|| Postal: Discussion Papers Administrator, Department of Economics, University of Essex, Wivenhoe Park, Colchester CO4 3SQ, U.K.|
References listed on IDEAS
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.:
- Alfredo Di Tillio, 2006.
"Subjective Expected Utility in Games,"
311, IGIER (Innocenzo Gasparini Institute for Economic Research), Bocconi University.
- Aviad Heifetz & Dov Samet, 1996.
"Topology-Free Typology of Beliefs,"
Game Theory and Information
9609002, EconWPA, revised 17 Sep 1996.
- Willemien Kets, 2012. "Bounded Reasoning and Higher-Order Uncertainty," Discussion Papers 1547, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Pintér, Miklós & Udvari, Zsolt, 2011. "Generalized type spaces," MPRA Paper 34107, University Library of Munich, Germany.
- Brandenburger Adam & Dekel Eddie, 1993. "Hierarchies of Beliefs and Common Knowledge," Journal of Economic Theory, Elsevier, vol. 59(1), pages 189-198, February.
- Heinsalu, Sander, 2014. "Universal type structures with unawareness," Games and Economic Behavior, Elsevier, vol. 83(C), pages 255-266.
- Meier, Martin, 2008. "Universal knowledge-belief structures," Games and Economic Behavior, Elsevier, vol. 62(1), pages 53-66, January.
- Chen, Yi-Chun, 2010. "Universality of the Epstein-Wang type structure," Games and Economic Behavior, Elsevier, vol. 68(1), pages 389-402, January.
- John C Harsanyi, 1997. "Games with incomplete information played by "bayesian" players," Levine's Working Paper Archive 1175, David K. Levine.
- Heifetz, Aviad, 1993. "The Bayesian Formulation of Incomplete Information--The Non-compact Case," International Journal of Game Theory, Springer, vol. 21(4), pages 329-338.
- Efe A. Ok & Pietro Ortoleva & Gil Riella, 2012. "Incomplete Preferences Under Uncertainty: Indecisiveness in Beliefs versus Tastes," Econometrica, Econometric Society, vol. 80(4), pages 1791-1808, 07.
- Aviad Heifetz & Willemien Kets, 2012. "All Types Naive and Canny," Discussion Papers 1550, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
When requesting a correction, please mention this item's handle: RePEc:esx:essedp:722. 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: (Essex Economics Web Manager)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.