Universality of the Epstein-Wang type structure
We prove that the type structure constructed in [Epstein, L., Wang, T., 1996. 'Belief about belief' without probabilities. Econometrica 64, 1343-1373] is a universal/terminal type structure into which every suitably regular type structure can be embedded. Moreover, it is unique up to a homeomorphism and every belief-complete type space can be mapped onto the universal one. We also show how our results help understand connections among several existing constructions.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
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.:
- Itzhak Gilboa & David Schmeidler, 1989.
"Maxmin Expected Utility with Non-Unique Prior,"
- MERTENS, Jean-François & SORIN , Sylvain & ZAMIR , Shmuel, 1994. "Repeated Games. Part C : Further Developments," CORE Discussion Papers 1994022, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- Larry Epstein & Michael Peters, 1996.
"A Revelation Principle For Competing Mechanisms,"
peters-96-02, University of Toronto, Department of Economics.
- Brandenburger Adam & Dekel Eddie, 1993.
"Hierarchies of Beliefs and Common Knowledge,"
Journal of Economic Theory,
Elsevier, vol. 59(1), pages 189-198, February.
- Di Tillio, Alfredo, 2008.
"Subjective expected utility in games,"
Econometric Society, vol. 3(3), September.
- Adam Brandenburger & Amanda Friedenberg & H. Jerome Keisler, 2008.
"Admissibility in Games,"
Econometric Society, vol. 76(2), pages 307-352, 03.
- Aviad Heifetz & Dov Samet, 1996.
"Topology-Free Typology of Beliefs,"
Game Theory and Information
9609002, EconWPA, revised 17 Sep 1996.
- Heifetz, Aviad, 1993. "The Bayesian Formulation of Incomplete Information--The Non-compact Case," International Journal of Game Theory, Springer;Game Theory Society, vol. 21(4), pages 329-338.
- Epstein, Larry G., 1997. "Preference, Rationalizability and Equilibrium," Journal of Economic Theory, Elsevier, vol. 73(1), pages 1-29, March.
- Mariotti, Thomas & Meier, Martin & Piccione, Michele, 2005. "Hierarchies of beliefs for compact possibility models," Journal of Mathematical Economics, Elsevier, vol. 41(3), pages 303-324, April.
- Pierpaolo Battigalli, "undated".
"Hierarchies of Conditional Beliefs and Interactive Epistemology in Dynamic Games,"
111, IGIER (Innocenzo Gasparini Institute for Economic Research), Bocconi University.
- Battigalli, Pierpaolo & Siniscalchi, Marciano, 1999. "Hierarchies of Conditional Beliefs and Interactive Epistemology in Dynamic Games," Journal of Economic Theory, Elsevier, vol. 88(1), pages 188-230, September.
- Ahn, David S., 2007. "Hierarchies of ambiguous beliefs," Journal of Economic Theory, Elsevier, vol. 136(1), pages 286-301, September.
- MERTENS , Jean-François & SORIN , Sylvain & ZAMIR , Shmuel, 1994. "Repeated Games. Part B : The Central Results," CORE Discussion Papers 1994021, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- MERTENS , Jean-François & SORIN , Sylvain & ZAMIR , Shmuel, 1994. "Repeated Games. Part A : Background Material," CORE Discussion Papers 1994020, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- Battigalli, Pierpaolo & Siniscalchi, Marciano, 2002. "Strong Belief and Forward Induction Reasoning," Journal of Economic Theory, Elsevier, vol. 106(2), pages 356-391, October.
When requesting a correction, please mention this item's handle: RePEc:eee:gamebe:v:68:y:2010:i:1:p:389-402. 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: (Dana Niculescu)
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.