Expected Utility Without the Completeness Axiom
AbstractWe study axiomatically the problem of obtaining an expected utility representation for a potentially incomplete preference relation over lotteries by means of a set of von Neumann-Morgenstern utility functions. It is shown that, when the prize space is a compact metric space, a preference relation admits such a multi-utility representation provided that it satisfies the standard axioms of expected utility theory. Moreover, the representing set of utilities is unique in a well-defined sense.
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 Yale School of Management in its series Yale School of Management Working Papers with number ysm404.
Date of creation: 28 Jul 2004
Date of revision:
Expected Utility; Incomplete Preferences;
Find related papers by JEL classification:
- D81 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Criteria for Decision-Making under Risk and Uncertainty
- D11 - Microeconomics - - Household Behavior - - - Consumer Economics: Theory
This paper has been announced in the following NEP Reports:
- NEP-ALL-2004-07-18 (All new papers)
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- Mc Kiernan, Daniel Kian, 2012. "Indifference, indecision, and coin-flipping," Journal of Mathematical Economics, Elsevier, vol. 48(4), pages 237-246.
- Paola Manzini & Marco Mariotti, 2003. "How vague can one be? Rational preferences without completeness or transitivity," Game Theory and Information 0312006, EconWPA, revised 16 Jul 2004.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: ().
If references are entirely missing, you can add them using this form.