• Aucun résultat trouvé

Annales du LAMSADE - Proceedings of the DIMACS –LAMSADE Workshop on Voting Theory And Preference Modelling Paris, 25–28 October 2006

N/A
N/A
Protected

Academic year: 2021

Partager "Annales du LAMSADE - Proceedings of the DIMACS –LAMSADE Workshop on Voting Theory And Preference Modelling Paris, 25–28 October 2006"

Copied!
356
0
0

Texte intégral

Loading

Figure

Table 2: Example 1: Bipolar-valued outranking relation
Figure 2: Run time statistics for randomly filled digraphs of order 15
Figure 3: Run time statistics for the AllKernels procedure (Algorithm 5)
Figure 4: General performance of Algorithm 5
+7

Références

Documents relatifs

Prise en compte d’une connaissance imparfaite à l’aide d’un pseudo-critère : procédure interactive de

This paper has proposed a general approach of conjoint measurement models tolerating intransitivity and/or incompleteness using simple tools based on several kinds of marginal traces

Our general framework for conjoint measurement allowing for nontransitive preferences is presented in section 4. Section 5 characterizes majoritarian preferences within this

From Example 1, one can see that, although for some problems a worst solution corresponds to some trivial input-parameter and can be computed in polynomial time (this is, for

3.3 Processus d’évaluation de la performance environnementale de synthèse Pour l’évaluation d’une performance environnementale de synthèse, nous proposons une démarche de

In Bouyssou and Pirlot (2005a), we have given a general definition of con- cordance relations and have shown that the preference relations produced by most of outranking methods

Notice at first that in a 3-clique-free graph where any vertex has degree exactly 3, each time we add a vertex to the solution and remove its neighbors, we decrease d by 5.. Indeed,

Based on the property that, for a suitable grid partition of the unit area where the network is deployed, the subgraphs within the squares of the grid are with high probability