Assumptions Let A=\{a_1 ,..,a_n\} be a set of n actions and let F=\{f_1 ,..,f_q\} be a consistent family of q criteria.
Without loss of generality, we will assume that these criteria have to be maximized. The basic data related to such a problem can be written in a table containing n\times q evaluations. Each line corresponds to an action and each column corresponds to a criterion. : \begin{array} \hline & f_{1}(\cdot) & f_{2}(\cdot) & \cdots & f_{j}(\cdot) & \cdots & f_{q}(\cdot) \\ \hline a_{1} & f_{1}(a_{1}) & f_{2}(a_{1}) & \cdots & f_{j}(a_{1}) & \cdots & f_{q}(a_{1}) \\ \hline a_{2} & f_{1}(a_{2}) & f_{2}(a_{2}) & \cdots & f_{j}(a_{2}) & \cdots & f_{q}(a_{2}) \\ \hline \cdots & \cdots &\cdots & \cdots & \cdots & \cdots & .\cdots \\ \hline a_{i} & f_{1}(a_{i}) & f_{2}(a_{i}) & \cdots & f_{j}(a_{i}) & \cdots & f_{q}(a_{i}) \\ \hline \cdots & \cdots & \cdots & \cdots& \cdots & \cdots & \cdots \\ \hline a_{n} & f_{1}(a_{n}) & f_{2}(a_{n}) & \cdots & f_{j}(a_{n}) & \cdots& f_{q}(a_{n}) \\ \hline \end{array}
Pairwise comparisons At first,
pairwise comparisons will be made between all the actions for each criterion: :d_k(a_i,a_j)=f_k(a_i)-f_k(a_j) d_k(a_i,a_j) is the difference between the evaluations of two actions for criterion f_k. Of course, these differences depend on the measurement scales used and are not always easy to compare for the decision maker.
Preference degree As a consequence the notion of preference function is introduced to translate the difference into a unicriterion preference degree as follows: :\pi_k(a_i,a_j)=P_k[d_k(a_i,a_j)] where P_k:\R\rightarrow[0,1] is a positive non-decreasing preference function such that P_k(0)=0. Six different types of preference function are proposed in the original Promethee definition. Among them, the linear unicriterion preference function is often used in practice for quantitative criteria: :P_k(x) \begin{cases} 0, & \text{if } x\le q_k \\ \frac{x-q_k}{p_k-q_k}, & \text{if } q_kp_k \end{cases} where q_j and p_j are respectively the indifference and preference thresholds. The meaning of these parameters is the following: when the difference is smaller than the indifference threshold it is considered as negligible by the decision maker. Therefore, the corresponding unicriterion preference degree is equal to zero. If the difference exceeds the preference threshold it is considered to be significant. Therefore, the unicriterion preference degree is equal to one (the maximum value). When the difference is between the two thresholds, an intermediate value is computed for the preference degree using a
linear interpolation.
Multicriteria preference degree When a preference function has been associated to each criterion by the decision maker, all comparisons between all pairs of actions can be done for all the criteria. A multicriteria preference degree is then computed to globally compare every couple of actions: :\pi(a,b)=\displaystyle\sum_{k=1}^qP_{k}(a,b)\cdot w_{k} Where w_k represents the weight of criterion f_k. It is assumed that w_k\ge 0 and \sum_{k=1}^q w_{k}=1. As a direct consequence, we have: :\pi(a_i,a_j)\ge 0 :\pi(a_i,a_j)+\pi(a_j,a_i)\le 1
Multicriteria preference flows In order to position every action with respect to all the other actions, two scores are computed: :\phi^{+}(a)=\frac{1}{n-1}\displaystyle\sum_{x \in A}\pi(a,x) :\phi^{-}(a)=\frac{1}{n-1}\displaystyle\sum_{x \in A}\pi(x,a) The positive preference flow \phi^{+}(a_i) quantifies how a given action a_i is globally preferred to all the other actions while the negative preference flow \phi^{-}(a_i) quantifies how a given action a_i is being globally preferred by all the other actions. An ideal action would have a positive preference flow equal to 1 and a negative preference flow equal to 0. The two preference flows induce two generally different complete rankings on the set of actions. The first one is obtained by ranking the actions according to the decreasing values of their positive flow scores. The second one is obtained by ranking the actions according to the increasing values of their negative flow scores. The Promethee I partial ranking is defined as the intersection of these two rankings. As a consequence, an action a_i will be as good as another action a_j if \phi^{+}(a_i) \ge \phi^{+}(a_j) and \phi^{-}(a_i)\le \phi^{-}(a_j) The positive and negative preference flows are aggregated into the net preference flow: :\phi(a)=\phi^{+}(a)-\phi^{-}(a) Direct consequences of the previous formula are: :\phi(a_i) \in [-1;1] :\sum_{a_i \in A} \phi(a_i)=0 The Promethee II complete ranking is obtained by ordering the actions according to the decreasing values of the net flow scores.
Unicriterion net flows According to the definition of the multicriteria preference degree, the multicriteria net flow can be disaggregated as follows: :\phi(a_i)=\displaystyle\sum_{k=1}^q\phi_{k}(a_i).w_{k} Where: :\phi_{k}(a_i)=\frac{1}{n-1}\displaystyle\sum_{a_j \in A}\{P_{k}(a_i,a_j)-P_{k}(a_j,a_i)\}. The unicriterion net flow, denoted \phi_{k}(a_i)\in[-1;1], has the same interpretation as the multicriteria net flow \phi(a_i) but is limited to one single criterion. Any action a_i can be characterized by a vector \vec \phi(a_i) =[\phi_1(a_i),\ldots,\phi_k(a_i),\phi_q(a_i)] in a q dimensional space. The GAIA plane is the principal plane obtained by applying a principal components analysis to the set of actions in this space.
Promethee preference functions • Usual ::P_j(d_j)= \begin{cases} 0 & \text{if } d_j\leq 0 \\[4pt] 1 & \text{if } d_j>0 \end{cases} • U-shape ::\begin{array}{cc} P_{j}(d_{j})=\left\{ \begin{array}{lll} 0 & \text{if} & |d_{j}| \leq q_{j} \\ \\ 1 & \text{if} & |d_{j}| > q_{j}\\ \end{array} \right. \end{array} • V-shape ::\begin{array}{cc} P_{j}(d_{j})=\left\{ \begin{array}{lll} \frac{p_{j}} & \text{if} & |d_{j}| \leq p_{j} \\ \\ 1 & \text{if} & |d_{j}| > p_{j}\\ \end{array} \right. \end{array} • Level ::\begin{array}{cc} P_{j}(d_{j})=\left\{ \begin{array}{lll} 0 & \text{if} & |d_{j}| \leq q_{j} \\ \\ \frac{1}{2} & \text{if} & q_{j} p_{j}\\ \end{array} \right. \end{array} • Linear ::\begin{array}{cc} P_{j}(d_{j})=\left\{ \begin{array}{lll} 0 & \text{if} & |d_{j}| \leq q_{j} \\ \\ \frac{|d_{j}|-q_{j}}{p_{j}-q_{j}} & \text{if} & q_{j} p_{j}\\ \end{array} \right. \end{array} • Gaussian ::P_{j}(d_{j})=1-e^{-\frac{d_{j}^{2}}{2s_{j}^{2}}} == Promethee rankings ==