Decomposition of Utility Functions on Subsets of Product Sets

François Sainfort and Jean M. Deichtmann
Additional contact information
François Sainfort: University of Wisconsin, Madison, Wisconsin
Jean M. Deichtmann: University of Wisconsin, Madison, Wisconsin

Operations Research, 1996, vol. 44, issue 4, 609-616

Abstract: The standard decomposition theorem for additive and multiplicative utility functions (Pollak [Pollak, R. O. 1967. Additive von Neumann-Morgenstern utility functions. Econometrica 35 485–494.], Keeney [Keeney, R. L. 1974. Multiplicative utility functions. Opns. Res. 22 22–34.]) assumes that the outcome set is a whole product set. In this paper this assumption is relaxed, and the question of whether or not a natural revision of this theorem necessarily holds is investigated. This paper proves that two additional conditions are needed for the decomposition theorem to hold in the context where the outcome set is a subset of a Cartesian product. It is argued that these two new conditions are satisfied by a large family of subsets corresponding to significant real-world problems. Further research avenues are suggested including a generalization of this new decomposition result to nonexpected utility theories.

Keywords: utility/preference; multiattribute; utility theory on subsets of product sets; utility/preference; theory; utility theory on subsets of product sets (search for similar items in EconPapers)
Date: 1996
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.44.4.609 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:44:y:1996:i:4:p:609-616

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().