On the decomposition of Generalized Additive Independence models
Michel Grabisch and
Christophe Labreuche (christophe.labreuche@thalesgroup.com)
Additional contact information
Christophe Labreuche: Laboratoire Albert Fert (ex-UMPhy Unité mixte de physique CNRS/Thales) - THALES [France] - Université Paris-Saclay - CNRS - Centre National de la Recherche Scientifique
Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) from HAL
Abstract:
The GAI (Generalized Additive Independence) model proposed by Fishburn is a generalization of the additive utility model, which need not satisfy mutual preferential independence. Its great generality makes however its application and study difficult. We consider a significant subclass of GAI models, namely the discrete 2-additive GAI models, and provide for this class a decomposition into nonnegative monotone terms. This decomposition allows a reduction from exponential to quadratic complexity in any optimization problem involving discrete 2-additive models, making them usable in practice.
Keywords: Multiattribute utility; Multichoice games; Utilité multi-attribut; jeux multichoix (search for similar items in EconPapers)
Date: 2015-09
New Economics Papers: this item is included in nep-dcm and nep-upt
Note: View the original document on HAL open archive server: https://shs.hal.science/halshs-01222546v1
References: Add references at CitEc
Citations:
Published in 2015
Downloads: (external link)
https://shs.hal.science/halshs-01222546v1/document (application/pdf)
Related works:
Working Paper: On the decomposition of Generalized Additive Independence models (2015)
Working Paper: On the decomposition of Generalized Additive Independence models (2015)
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:hal:cesptp:halshs-01222546
Access Statistics for this paper
More papers in Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) from HAL
Bibliographic data for series maintained by CCSD (hal@ccsd.cnrs.fr).