When do type structures contain all hierarchies of beliefs?
AbstractHierarchies of beliefs play a central role in game theory. In practice, they are modeled by type structures. This allows the analyst to describe hierarchies without explicitly specifying an infinite sequence of beliefs. The focus of this paper is type structures that contain all hierarchies of beliefs. Can the analyst identify these structures without explicit reference to hierarchies? That is, does there exist a test, defined on the type structure alone, so that the structure passes this test only if it contains all hierarchies of beliefs? This paper investigates one such test. The test is based on the concept of completeness [Brandenburger, A., 2003. On the existence of a 'complete' possibility structure. In: Basili, M., Dimitri, N., Gilboa, I. (Eds.), Cognitive Processes and Economic Behavior. Routledge, pp. 30-34], a concept that has played an important role in epistemic game theory.
Download InfoIf 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.
Bibliographic InfoArticle provided by Elsevier in its journal Games and Economic Behavior.
Volume (Year): 68 (2010)
Issue (Month): 1 (January)
Contact details of provider:
Web page: http://www.elsevier.com/locate/inca/622836
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.:
- MEIER, Martin, 2001. "An infinitary probability logic for type spaces," CORE Discussion Papers 2001061, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- Heifetz, Aviad & Samet, Dov, 1998.
"Topology-Free Typology of Beliefs,"
Journal of Economic Theory,
Elsevier, vol. 82(2), pages 324-341, October.
- Heifetz, Aviad & Samet, Dov, 1999. "Coherent beliefs are not always types," Journal of Mathematical Economics, Elsevier, vol. 32(4), pages 475-488, December.
- Alfredo Di Tillio, 2006.
"Subjective Expected Utility in Games,"
311, IGIER (Innocenzo Gasparini Institute for Economic Research), Bocconi University.
- Muhamet Yildiz & Jonathan Weinsten, 2004.
"Impact of higher-order uncertainty,"
Econometric Society 2004 North American Winter Meetings
157, Econometric Society.
- 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).
- Barton L. Lipman, 1997.
"Finite Order Implications of Common Priors,"
Game Theory and Information
- Brandenburger Adam & Dekel Eddie, 1993. "Hierarchies of Beliefs and Common Knowledge," Journal of Economic Theory, Elsevier, vol. 59(1), pages 189-198, February.
- 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.
- Pierpaolo Battigalli, . "Hierarchies of Conditional Beliefs and Interactive Epistemology in Dynamic Games," Working Papers 111, IGIER (Innocenzo Gasparini Institute for Economic Research), Bocconi University.
- John Geanakoplos & Heracles M. Polemarchakis, 1982. "We Can't Disagree Forever," Cowles Foundation Discussion Papers 639, Cowles Foundation for Research in Economics, Yale University.
- Geanakoplos, John D. & Polemarchakis, Heraklis M., 1982. "We can't disagree forever," Journal of Economic Theory, Elsevier, vol. 28(1), pages 192-200, October.
- Adam Brandenburger & Amanda Friedenberg & H. Jerome Keisler, 2008. "Admissibility in Games," Econometrica, Econometric Society, vol. 76(2), pages 307-352, 03.
- Battigalli, Pierpaolo & Siniscalchi, Marciano, 2002. "Strong Belief and Forward Induction Reasoning," Journal of Economic Theory, Elsevier, vol. 106(2), pages 356-391, October.
- MEIER, Martin, 2002. "Finitely additive beliefs and universal type spaces," CORE Discussion Papers 2002075, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- Willemien Kets, 2012. "Bounded Reasoning and Higher-Order Uncertainty," Discussion Papers 1547, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Arieli, Itai, 2010. "Rationalizability in continuous games," Journal of Mathematical Economics, Elsevier, vol. 46(5), pages 912-924, September.
- Grabiszewski, Konrad, 2010. "Kernel-based type spaces," Journal of Economic Theory, Elsevier, vol. 145(6), pages 2483-2495, November.
- Aviad Heifetz & Willemien Kets, 2012. "All Types Naive and Canny," Discussion Papers 1550, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei).
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.