A Generalized Decomposable Multiattribute Utility Function

In this paper a generalized decomposable multiattribute utility function (MAUF) is developed. It is demonstrated that this new MAUF structure is more general than other well-known MAUF structures, such as additive, multiplicative, and multilinear. Therefore, it is more flexible and does not require that the decision maker be consistent with restrictive assumptions such as preferential independence conditions about his/her preferences. We demonstrate that this structure does not require any underlying assumption and hence solves the interdependence among attributes. Hence there is no need for verification of its structure. Several useful extensions and properties for this generalized decomposable MAUF are developed which simplify its structure or assessment. The concept of utility efficiency is developed to identify efficient alternatives when there exists partial information on the scaling constants of an assumed MAUF. It is assumed that the structure (decomposition) of the MAUF is known and the partial information about the scaling constants of the decision maker is in the form of bounds or constraints. For the generalized decomposable structure, linear programming is sufficient to solve all ensuing problems. Some examples are provided