Multiperson Choquet-Compromise Search on Large Combinatorial Domains - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2007

Multiperson Choquet-Compromise Search on Large Combinatorial Domains

Sergio Queiroz
  • Fonction : Auteur
  • PersonId : 967985

Résumé

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.
Fichier non déposé

Dates et versions

hal-01306016 , version 1 (22-04-2016)

Identifiants

Citer

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⟩
31 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More