Extension card · Stochastic
VIKOR-SMAA (stochastic acceptability)
This is the form of VIKOR that runs when, about the criterion weights, only uncertainty information is available rather than a single number. Instead of a single compromise rank, it gives each alternative's probability of achieving each possible rank.
Base method
VIKOR →
Philosophy, mechanics, strengths and weaknesses are on the base method card; this card describes only the difference.
Data type (family)
Stochastic →
What this data type is, when to use it, how to write it in a cell: the family's full account is here.
What Changes from the Base Method?
Four things change; VIKOR's four steps (best/worst value, S and R, Q, comparison) do not change in themselves, they are simply repeated thousands of times.
Cells. The decision matrix's cells are single numbers, as in crisp VIKOR; this extension does not change the cell format. What changes is the weights. Crisp VIKOR asks for the weight as a single number. Here no fixed number is given for the weight at all; the method scans the entire simplex of weight combinations that sum to 1, on the assumption that every criterion's weight can equally likely take any value.
Scale equalisation and S/R/Q. DecisionMind draws a large number of samples from this weight space, ten thousand by default. Each sample is, on its own, a valid weight combination. Crisp VIKOR's four steps, exactly as on the base card, are run separately and in full for each sample's weights. The steps are the same: best/worst value, linear normalisation, S, R and Q with v = 0.5 (changeable). Instead of a single S, R, Q triple, as many S, R, Q triples as there are samples emerge.
Aggregation. In each sample the alternatives are ranked by their own Q. DecisionMind counts these thousands of rankings: it tabulates, for every alternative, in what percentage of samples it came first, in what percentage second, in what percentage third. This is called the rank acceptability distribution.
Result and defuzzification. The rank acceptability distribution is reduced to a single comparison figure. The holistic acceptability index is a weighted sum that gives the highest contribution to the probability of first place and the lowest to last place. Ranking is done by this index. Crisp VIKOR's two compromise conditions, acceptable advantage and acceptable stability, are not calculated here at all. Their place is taken by this distribution itself, spread over the entire sample. Instead of looking at a single Q gap, the user sees a direct answer to the question "what is the probability that this alternative is first."
DecisionMind exposes the number of samples (N, default 10,000) and the compromise coefficient (v, default 0.5) to the user for this extension. The random seed used for sampling is not a parameter open to the user; the engine internally uses a fixed seed. For this reason, two runs with the same N and the same v give exactly the same result. Reproducibility comes not from a setting the user chooses but from the engine's fixed internal seed.
How to Read the Output
The output is not a ranking but a probability distribution for each alternative: "this alternative is first with such a probability, second with such a probability," and so on. The holistic acceptability index is a single number summarising this distribution, and a larger value is better. This is the exact opposite of crisp VIKOR's rule that a small Q is good; it is a separate scale operating in the opposite direction. If two alternatives' first-place probabilities are close to one another, this is an honest result of VIKOR-SMAA, not a calculation error. If uncertainty about the weights is genuinely large, there is no clear winner between two alternatives.
Thus instead of writing:
"According to VIKOR-SMAA the best alternative is A2"
the report should read:
"A2 comes first in 70.4 per cent of the samples and also has the highest value in the holistic acceptability index. A1 and A3's first-place probabilities are 13.7 per cent and 16.0 per cent respectively"
When to Prefer This over the Base Method
This extension is suitable when decision-makers cannot agree about the criterion weights, when giving a weight is being avoided, or when nothing is known beyond the range the weight might fall in. If the criterion values themselves are given precisely and only the weights are uncertain, this extension runs directly. If the criterion values themselves are also uncertain, the type of that uncertainty (approximation, a range, or a probability) should first be identified and the relevant data-type card consulted. If the weights are already clear and the decision-makers have agreed on them, crisp VIKOR is sufficient; running VIKOR-SMAA would then be an unnecessary sweep of uncertainty. Base VIKOR's exit condition applies here too: if no compromise at all is acceptable on one criterion, outranking methods should be used instead.
Mistakes Specific to This Extension
Keeping the number of samples (N) small. If the weight space is not swept thoroughly enough, the acceptability figures come out noisy and can produce different numbers under a different seed even with the same N. This is shown in Case 1 below.
Choosing the compromise coefficient v as 0 or 1. The same error as in crisp VIKOR applies here too. At these extremes the method looks only at total benefit or only at regret, and stops being a compromise.
Looking for crisp VIKOR's two conditions here and failing to find them. This extension never calculates the acceptable-advantage and acceptable-stability conditions; their place is taken by the acceptability distribution itself. Treating the engine as having "left this out" is wrong; the concept is simply different here.
Confusing the holistic acceptability index with crisp VIKOR's Q. In this index a large value is good; in crisp VIKOR's Q a small value is good. Reading the two figures in the same direction reverses the ranking.
The governing principle is this:
VIKOR-SMAA's output is a probability distribution, not a single ranking. Writing down only the top-ranked alternative, without stating the sample count and the compromise coefficient in the report, is a misuse of this extension.
Cases
The first case is DecisionMind's validation example: a fixed, sector-independent table that applies Lahdelma et al.'s SMAA framework to crisp VIKOR. The second case is an illustrative construction.
1. Illustrative example (DecisionMind's validation example): Comparing three environmental technologies under weight uncertainty
DecisionMind's VIKOR-SMAA validation table compares three alternatives on three criteria; all three criteria are "higher is better" and no information at all is given about the weights.
| Alternative | C1 | C2 | C3 |
|---|---|---|---|
| A1 | 8 | 7 | 6 |
| A2 | 7 | 9 | 8 |
| A3 | 6 | 8 | 9 |
The method draws 2,000 samples from the weight space, runs crisp VIKOR in full for each sample with v = 0.5, and builds the rank acceptability distribution.
| Alternative | 1st-place probability | 2nd-place probability | 3rd-place probability | Holistic acceptability |
|---|---|---|---|---|
| A2 | 0.704 | 0.296 | 0.000 | 0.852 |
| A3 | 0.160 | 0.519 | 0.322 | 0.526 |
| A1 | 0.137 | 0.186 | 0.678 | 0.455 |
The result reads as follows. A2 comes first in 70.4 per cent of the samples and never comes last in any sample; it is also clearly ahead on the holistic acceptability index. A1 comes last in 67.8 per cent of the samples. A3 is mostly second under weight uncertainty.
The team's hesitation: what changes if the sample count is raised from 2,000 to 100,000? The holistic acceptability index comes out at 0.464 for A1, 0.847 for A2 and 0.522 for A3; the rank and the magnitudes stay nearly the same. But when the sample count is lowered to 20 and tried with ten different seeds, A1 and A3's second-third rank swaps in three of the ten trials. A2 stays first in every trial. This shows that a low sample count makes the second-third distinction noisy, not A2's first place.
In the report: "In a sweep with 2,000 samples, A2 comes first in 70.4 per cent of the samples and is clearly ahead on the holistic acceptability index. This result does not change when the sample count is raised to 100,000. When the sample count is lowered to 20, A1 and A3's second-third rank can change depending on the seed."
Source: DecisionMind's VIKOR-SMAA validation example; a fixed, sector-independent table built to test the engine's weight sampling and acceptability arithmetic. The acceptability values and the sample-count sensitivity were independently recomputed in the preparation of this card, in Python, by calling the same engine kernel directly.
2. Software procurement: Weight uncertainty in choosing enterprise resource-planning software
An organisation's IT, finance and operations units will jointly choose an enterprise resource-planning (ERP) software package. Three candidate packages have been scored on functionality, ease of integration and total cost of ownership (lower is better). The three units cannot agree on the importance of the criteria. IT wants to prioritise integration, finance wants to prioritise cost, and operations wants to prioritise functionality. Rather than settling on a single weight set, the organisation has chosen to carry the weight uncertainty as it stands.
| Software | Functionality | Integration | Cost (lower is better) |
|---|---|---|---|
| ERP-X | 7 | 6 | 8 |
| ERP-Y | 8 | 5 | 5 |
| ERP-Z | 6 | 9 | 4 |
The method sweeps the weight space with ten thousand samples and builds each package's rank acceptability distribution. ERP-Z comes first in 54.6 per cent of the samples, ERP-Y in 45.0 per cent. ERP-X almost never comes first (0.4 per cent). On holistic acceptability, ERP-Z (0.724) is just ahead of ERP-Y (0.675).
The organisation's hesitation: ERP-Z's and ERP-Y's first-place probabilities are close to one another. This is a direct sign that the three units genuinely disagree about the weights. When the sample count is lowered (to 15) and tried with different seeds, ERP-Y overtakes ERP-Z in three of the ten trials. This reversal is an artefact of the low sample count, not a real weight scenario. The organisation should report that ERP-X is clearly third, but that a definite choice between ERP-Y and ERP-Z cannot be made without the units reaching a weight agreement.
In the report: "ERP-Z's and ERP-Y's first-place probabilities (54.6 per cent and 45.0 per cent) are close to one another. This is a direct consequence of the three units' disagreement about the weights. ERP-X can be eliminated, since it almost never comes first across the entire weight space (0.4 per cent). A definite choice between ERP-Y and ERP-Z cannot be made without the units reaching a weight agreement."
3. What Not to Do
The first error is reading A2's 70.4 per cent first-place probability in Case 1 as "A2 is definitely the best." This is not a certainty but a probability under weight uncertainty. The second error is reading the holistic acceptability index as though it were crisp VIKOR's Q and treating a small value as good; in this index a large value is good. The third error is, in Case 2, ignoring how close ERP-Z's and ERP-Y's probabilities are and declaring whichever has the slightly higher holistic index the "winner"; this extension is designed by DecisionMind to report this closeness, not to hide it.
Sources
For the formulas behind each step, the intermediate tables and citation formats, see the DecisionMind method page: decisionmind.app/library/vikor-smaa
Lahdelma, R., Hokkanen, J., & Salminen, P. (1998). SMAA – Stochastic multiobjective acceptability analysis. European Journal of Operational Research, 106(1), 137–143. DOI: 10.1016/S0377-2217(97)00163-X
Lahdelma, R., & Salminen, P. (2001). SMAA-2: Stochastic multicriteria acceptability analysis for group decision making. Operations Research, 49(3), 444–454. DOI: 10.1287/opre.49.3.444.11220
Tervonen, T., Figueira, J. R., Lahdelma, R., Almeida Dias, J., & Salminen, P. (2009). A stochastic method for robustness analysis in sorting problems. European Journal of Operational Research, 192(1), 236–242. DOI: 10.1016/j.ejor.2007.09.008
Aydoğan, E. K., & Özmen, M. (2017). The stochastic VIKOR method and its use in reverse logistic option selection problem. RAIRO - Operations Research, 51(2), 375–389. DOI: 10.1051/ro/2016027
Opricovic, S., & Tzeng, G.-H. (2004). Compromise solution by MCDM methods: A comparative analysis of VIKOR and TOPSIS. European Journal of Operational Research, 156(2), 445–455. DOI: 10.1016/S0377-2217(03)00020-1