{GAI}-Networks: Optimization, Ranking and Collective Choice in Combinatorial Domains - Archive ouverte HAL Access content directly
Journal Articles Foundations of Computing and Decision Sciences Year : 2008

{GAI}-Networks: Optimization, Ranking and Collective Choice in Combinatorial Domains

(1) , (1) , (1)
1
Christophe Gonzales
Patrice Perny
Sergio Queiroz
  • Function : Author

Abstract

This paper deals with preference representation and decision-making problems in the context of multiattribute utility theory. We focus on the generalized additive decomposable utility model (GAI) which allows interactions between attributes while preserving some decomposability. We present procedures to deal with the problem of optimization (choice) and ranking of multiattribute items. We also address multiperson decision problems and compromise search using weighted Tchebycheff distances. These procedures are all based on GAI networks, a graphical model used to represent GAI utilities. Results of numerical experiments highlight the practical efficiency of our procedures.
Not file

Dates and versions

hal-01170369 , version 1 (01-07-2015)

Identifiers

  • HAL Id : hal-01170369 , version 1

Cite

Christophe Gonzales, Patrice Perny, Sergio Queiroz. {GAI}-Networks: Optimization, Ranking and Collective Choice in Combinatorial Domains. Foundations of Computing and Decision Sciences, 2008, 33 (1), pp.3-24. ⟨hal-01170369⟩
44 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More