Rank-Dependent, Subjective Expected-Utility Representations
Gambles are recursively generated from pure payoffs, events, and other gambles, and a preference order over them is assumed. Weighted average utility representations are studied that are strictly increasing in each payoff and for which the weights depend both on the events underlying the gamble and the preference ranking over the several component payoffs. Basically two results are derive: a characterization of monotonicity in terms of the weights, and an axiomatization of the representation. The latter rests on two important conditions: a decomposition of gambles into binary ones and a necessary commutativity condition on events in a particular class of binary gambles. A number of unsolved problems are cited. Copyright 1988 by Kluwer Academic Publishers
To our knowledge, this item is not available for
download. To find whether it is available, there are three
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.
When requesting a correction, please mention this item's handle: RePEc:kap:jrisku:v:1:y:1988:i:3:p:305-32. 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: (Sonal Shukla)or (Christopher F. Baum)
If references are entirely missing, you can add them using this form.