The semantics of preference-based belief operators
AbstractWe show how different kinds of belief operators derived from preferences can be defined in terms an accessibility relation of epistemic priority, and characterized by means of a vector of nested accessibility relations. The semantic structure is used to reconcile and compare certain non-standard notions of belief that have recently been used in epistemic analyses of games.
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.
Bibliographic InfoPaper provided by Oslo University, Department of Economics in its series Memorandum with number 05/2003.
Length: 30 pages
Date of creation: 21 Feb 2003
Date of revision:
Contact details of provider:
Postal: Department of Economics, University of Oslo, P.O Box 1095 Blindern, N-0317 Oslo, Norway
Phone: 22 85 51 27
Fax: 22 85 50 35
Web page: http://www.oekonomi.uio.no/indexe.html
More information through EDIRC
Belief operators; decision theory; belief revision;
Find related papers by JEL classification:
- D81 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Criteria for Decision-Making under Risk and Uncertainty
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.:
- Martin J. Osborne & Ariel Rubinstein, 1994.
"A Course in Game Theory,"
MIT Press Books,
The MIT Press,
edition 1, volume 1, number 0262650401.
- P. Battigalli & M. Siniscalchi, 1999.
"Interactive Beliefs and Forward Induction,"
Princeton Economic Theory Papers
99f3, Economics Department, Princeton University.
- Asheim,G.B., 1999.
"On the epistemic foundation for backward induction,"
30/1999, Oslo University, Department of Economics.
- Asheim, Geir B., 2002. "On the epistemic foundation for backward induction," Mathematical Social Sciences, Elsevier, vol. 44(2), pages 121-144, November.
- Asheim,G.B. & Dufwenberg,M., 2000.
"Admissibility and common belief,"
07/2000, Oslo University, Department of Economics.
- Asheim, Geir B. & Perea, Andres, 2005. "Sequential and quasi-perfect rationalizability in extensive games," Games and Economic Behavior, Elsevier, vol. 53(1), pages 15-42, October.
- Tan, Tommy Chin-Chiu & da Costa Werlang, Sergio Ribeiro, 1988. "The Bayesian foundations of solution concepts of games," Journal of Economic Theory, Elsevier, vol. 45(2), pages 370-391, August.
- Roger B. Myerson, 1984.
"Multistage Games with Communication,"
590, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Blume, Lawrence & Brandenburger, Adam & Dekel, Eddie, 1991. "Lexicographic Probabilities and Choice under Uncertainty," Econometrica, Econometric Society, vol. 59(1), pages 61-79, January.
- Asheim, Geir B. & Sovik, Ylva, 2005. "Preference-based belief operators," Mathematical Social Sciences, Elsevier, vol. 50(1), pages 61-82, July.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Rhiana Bergh-Seeley).
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.