Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, EpiSciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
Skip to Main content Skip to Navigation
Conference papers

Multiperson Choquet-Compromise Search on Large Combinatorial Domains

Sergio Queiroz 1 
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : In this paper we address the multiperson decision making problem when the preferences of each individual is represented by a generalized additive independent (GAI) utility on a product set (the size of which forbids any attempt of exhaustive enumeration of its elements). We focus our attention on finding an optimal compromise solution when it corresponds to maximize a Choquet integral over the elements on the product set. We propose a fast procedure for the exact determination of this optimal compromise solution. This procedure relies on a ranking algorithm that enumerates top-k-solutions of a GAI-Network until a stop condition is met. Finally, we provide results of numerical experiments that indicate the practical efficiency of our procedure.
Document type :
Conference papers
Complete list of metadata
Contributor : Lip6 Publications Connect in order to contact the contributor
Submitted on : Friday, April 22, 2016 - 11:04:44 AM
Last modification on : Sunday, June 26, 2022 - 9:59:16 AM



Sergio Queiroz. Multiperson Choquet-Compromise Search on Large Combinatorial Domains. 2nd IEEE International Workshop on Soft Computing Applications SOFA, Aug 2007, Oradea, Romania. pp.187-192, ⟨10.1109/SOFA.2007.4318327⟩. ⟨hal-01306016⟩



Record views