Outranking digraph, best choice decision problem, Multiple criteria decision aid, Algorithmic decision theory
Abstract :
[en] The presentation discusses the use of the digraph kernels for computing a best choice recommendation from a valued outranking digraph. The classical best decision problem approach is critically reviewed. New practical principles underlying a best choice recommendation are introduced which promote the outranking kernels as candidates for best choice recommendations. Some illustrative applications were eventually shown in order to convince the audience.
Research center :
FDEF, Service de Mathématiques Appliquées (SMA)
Disciplines :
Computer science
Author, co-author :
Bisdorff, Raymond ; University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC)
Language :
French
Title :
Exploitation en problématique du choix d'une relation de surclassement valuée
Alternative titles :
[en] Using a valued outranking relation for solving the best choice decision problem
Publication date :
11 October 2005
Number of pages :
176
Event name :
Séminaire du LAMSADE
Event organizer :
LAMSADE - Laboratoire d'Analyse et de Modélisation des Systèmes d'Aide à la Décision UMR 7243 CNRS