Preference aggregation in combinatorial domains using GAI-nets - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2006

Preference aggregation in combinatorial domains using GAI-nets

Christophe Gonzales
Patrice Perny
Sergio Queiroz
  • Fonction : Auteur

Résumé

This paper deals with preference representation and aggregation in combinatorial domains. We assume that the set of alternatives is defined as the cartesian product of finite domains and that agents' preferences are represented by generalized additive decomposable (GAI) utility functions. GAI functions allow an efficient representation of interactions between attributes while preserving some decomposability of the model. We address the preference aggregation problem and consider several criteria to define the notion of compromise solution (maxmin, minmaxregret, weighted Tchebycheff distance). For each of them, we propose a fast procedure for the exact determination of the optimal compromise solution in the product set. This procedure relies on a ranking algorithm enumerating solutions according to the sum of the agents individual utilities until a boundary condition is reached. We provide results of numerical experiments to highlight the practical efficiency of our procedure
Fichier principal
Vignette du fichier
AN6LAMSADE_165-179.pdf (154.94 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00119349 , version 1 (08-12-2006)

Identifiants

  • HAL Id : hal-00119349 , version 1

Citer

Christophe Gonzales, Patrice Perny, Sergio Queiroz. Preference aggregation in combinatorial domains using GAI-nets. DIMACS - LAMSADE Workshop on Voting Theory And Preference Modelling, Oct 2006, Paris, France. pp.165-179. ⟨hal-00119349⟩
122 Consultations
131 Téléchargements

Partager

Gmail Facebook X LinkedIn More