Skip to Main content Skip to Navigation
Conference papers

Preference aggregation in combinatorial domains using GAI-nets

Christophe Gonzales 1 Patrice Perny 1 Sergio Queiroz 1 
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : 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
Complete list of metadata

Cited literature [19 references]  Display  Hide  Download
Contributor : Marie-Hélène Hugonnard-Roche Connect in order to contact the contributor
Submitted on : Friday, December 8, 2006 - 4:31:55 PM
Last modification on : Sunday, June 26, 2022 - 10:02:16 AM
Long-term archiving on: : Wednesday, April 7, 2010 - 12:10:53 AM


Files produced by the author(s)


  • HAL Id : hal-00119349, version 1


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⟩



Record views


Files downloads