Decomposition of Multiattribute Utility Functions.
MASSACHUSETTS INST OF TECH CAMBRIDGE OPERATIONS RESEARCH CENTER
Pagination or Media Count:
Given N 1 attributes, various sets of preferential independence and utility independence assumptions among the last N attributes imply that the utility function can be written as a function whose arguments consist of the first attribute and utility functions on each of the other N attributes. Implications of such independence assumptions over overlapping sets of attributes and in hierarchical structures of attributes are considered. The basic ideas are then extended to what will be referred to as conditional preferential independence and conditional utility independence. All of the conditions examined serve to simplify the assessment of multiattribute utility functions. Author
- Operations Research