Extension card · Classical
Balanced SPOTIS (Shekhovtsov, Dezert and Sałabun, 2025)
Balanced SPOTIS is the form of SPOTIS that, alongside the fixed ideal, also takes into account a "realistic target" point set by the decision-maker. It blends the distance to the two reference points with a single coefficient, and still ranks alternatives by one distance value.
Base method
SPOTIS →
Philosophy, mechanics, strengths and weaknesses are on the base method card; this card describes only the difference.
Data type (family)
Classical →
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?
What changes here is not the data type but the number of reference points. Cells are identical to crisp SPOTIS: a single number.
Input. Crisp SPOTIS asks for a single fixed pair of bounds (the "best/worst conceivable" for every criterion) and builds its ideal (ISP) from them. Balanced SPOTIS asks for the same fixed bounds, but additionally takes, as input, an "expected target point" (ESP, Expectation Solution Point) set by the decision-maker. The ESP is not "the theoretical best" but a target that "counts as realistically sufficient under these conditions"; it must stay inside the fixed bounds. An α (alpha) coefficient is also entered; this sets the weight between the two reference points.
Reference point. Crisp SPOTIS has a single reference (the ISP), and every alternative's distance is measured to it alone. Balanced SPOTIS builds two references: the ISP from the fixed bounds (the upper bound for a benefit criterion, the lower bound for a cost criterion), and the ESP taken directly from the decision-maker's input. Both are scaled against the same fixed bound range.
Distance and combination. Crisp SPOTIS computes a single scaled distance. Here, two separate scaled distances are computed for every alternative: D_isp (distance to the ideal) and D_esp (distance to the target). The two distances are blended with the α coefficient: P_i = (1−α)·D_isp,i + α·D_esp,i. At α = 0 the method reduces to crisp SPOTIS itself (only the ideal is considered); at α = 1 the method looks only at distance to the target. An intermediate α value takes both references into account together.
Result and defuzzification. As in crisp SPOTIS, a small P value is good, and the ranking runs by increasing distance. This direction does not change.
DecisionMind fixes, for Balanced SPOTIS, the rule that builds the ISP from the fixed bounds and the formula that blends the two distances. Weights are taken from outside as crisp numbers; the method does not generate weights.
How to Read the Output
The distance value is read as in crisp SPOTIS: a small value is good, a large value is bad, and as long as the fixed bounds do not change, one alternative's distance does not change when the alternative set changes.
The difference is here. Because this distance is now a blend of two references, "how close to the ideal" and "how close to the realistic target" are merged into a single number. At α = 0.5, if an alternative's value on a criterion falls between the ESP and the ISP, that criterion's contribution becomes independent of the alternative's exact position. This is a theorem the source paper proves itself (Equations 7–8), not a computational error; it is a natural consequence of the region between the two references being treated as balanced-out "indifferent" territory.
Thus instead of writing:
"According to Balanced SPOTIS, A2 scores 0.425, and this is a single, final result"
the report should read:
"A2's distance at this α value is 0.425; as α changes (for instance between α = 0, which looks only at the ideal, and α = 1, which looks only at the target), this distance can change, and the α range over which the ranking stays stable must be shown separately"
When to Prefer This over the Base Method
This extension is used when the decision-maker wants to evaluate not only against the theoretical ideal but also against a target that is "realistically sufficient under these conditions." It suits, for example, recurring decisions compared over time, where an institution wants to carry both a minimum acceptable standard and a desired best standard together. Crisp SPOTIS's exit condition applies here too: if the fixed bounds are unknown or contested, or if no compromise is acceptable on one criterion, this extension should likewise not be used.
If evaluation against a single reference (the ideal) alone is sufficient, base SPOTIS is used; the extra burden of defining a second reference point (justifying the ESP and α) is not needed.
Mistakes Specific to This Extension
Entering the ESP outside the fixed bounds. The source paper explicitly requires that the ESP stay inside the fixed bound range for every criterion. An ESP outside that range makes the distance calculation meaningless.
Choosing the fixed bounds narrower than the real value range. This is also a known error in crisp SPOTIS, but it matters particularly here. If an alternative's real value goes beyond the fixed bound (and hence the ISP), that alternative is treated not as having "reached" the ideal but as having "exceeded" it. Its distance can then come out worse than an alternative that stays within the bound. If an alternative sitting exactly on the fixed upper bound could in fact score even higher, that is a sign the bound does not cover the realistic upper value and should be widened.
Assuming the region between the two references is "discriminating" at α = 0.5. If an alternative's value on a criterion falls between the ESP and the ISP, that criterion's contribution at α = 0.5 is independent of the alternative's position. This is a theorem the source paper proves itself. If fine differences in this region are being sought, α should be moved away from 0.5, or the analysis should be repeated with several α values (for instance 0.1, 0.5 and 0.9).
Reading the distance value the wrong way round. In the SPOTIS family a small distance is good; reading a large distance as "the best" reverses the ranking.
The governing principle is this:
Balanced SPOTIS's promise is to place a realistic target alongside the ideal and balance the two; this balance is trustworthy only when the ESP is set inside the fixed bounds with justification, and when the report explains what the chosen value of α means.
Cases
The first case is DecisionMind's validation example. The values are not the source paper's own numerical example; they are a formula-faithful fixture, produced with the pymcdm library's Balanced SPOTIS implementation. This method was flagged in a directional test during the engine catalogue scan; the case below shows exactly where that flag came from. The second case is an illustrative construction.
1. Illustrative example: Balanced evaluation of three quotations on three criteria
An institution will choose among three equipment quotations. There are three criteria: a performance score and a reliability score (higher is better), and a maintenance-cost index (lower is better). The institution has set a fixed "best/worst conceivable" range for every criterion, and has also defined a target point (ESP) that "would count as sufficient for this purchase." α is set to 0.5 to balance the ideal and the target with equal weight.
| Quotation | Performance | Reliability | Maintenance-cost index |
|---|---|---|---|
| T1 | 4.0 | 7.0 | 2.0 |
| T2 | 7.0 | 5.0 | 6.0 |
| T3 | 5.0 | 6.0 | 3.0 |
| Direction | higher is better | higher is better | lower is better |
| Weight | 0.40 | 0.35 | 0.25 |
| Fixed bound | [4, 7] | [5, 7] | [2, 6] |
| Target (ESP) | 6.0 | 7.0 | 2.0 |
| α | 0.5 | 0.5 | 0.5 |
The method builds the ideal (ISP) for every criterion from the fixed bounds (the upper bound for performance and reliability, the lower bound for cost); it takes the target directly from the ESP. It computes each quotation's scaled distance to both the ideal and the target, and blends them with α = 0.5.
| Quotation | Balanced distance (P) | Rank |
|---|---|---|
| T1 | 0.3333 | 1 |
| T3 | 0.4375 | 2 |
| T2 | 0.6667 | 3 |
The result reads as follows. T1 has the smallest total distance because it sits exactly on both the target and the ideal for reliability (7.0), and also exactly on the target for maintenance cost (2.0); it is weak only on performance (4.0), but this criterion's weight is balanced by the other two. T2 is best on performance, yet finishes last because it is weak on reliability and cost.
The institution's hesitation appears exactly here, on T2's performance criterion. T2's performance score is 7.0, which already coincides with the fixed bound's upper value (7); that is, T2 sits exactly on the ideal for this criterion. If the performance score could in fact be measured even higher (say, 8.0), the distance calculation would treat this not as "better" but as "outside the bound," and T2's distance would not improve, and could even worsen. This is a sign that the institution needs to set the fixed bound so that it fully covers the real performance range (for instance, by raising the upper bound to 8); a structure resembling this table was flagged in the catalogue scan for exactly this reason.
A separate hesitation concerns α: if α is pulled to zero (the ideal only), T1 is still first (0.40); if α is pulled to one (the target only), T1 is also first (0.2667). In this example the ranking is stable across the entire range of α; this should not be expected of every table.
In the report: "With the given fixed bounds, target and α = 0.5, T1 has the lowest distance (0.3333); this ranking holds for every value of α between 0 and 1. Because the upper bound for the performance criterion (7) coincides with T2's value on that criterion, whether the bound covers the real performance range should be reviewed separately."
Source: illustrative example; a DecisionMind validation record, produced with the pymcdm library's Balanced SPOTIS implementation. The computational logic follows the method of Shekhovtsov, Dezert and Sałabun (2025), but this table and its figures are not taken from the paper.
2. Telecommunications: A multi-year comparison of base-station equipment suppliers
A telecommunications operator will compare three equipment suppliers against the same fixed standards every year for a network-expansion investment, renewing the contract accordingly. There are three criteria: data-processing capacity and energy efficiency (higher is better), and fault-response time (lower is better). The operator has set fixed bounds based on industry standards, and has also defined a target point (ESP) as "the minimum acceptable performance for this year." α is set to 0.5 so that both the ideal and this year's expectation count equally.
The method computes each supplier's distance to both the fixed ideal and the target, and blends them. Suppose the result places first a supplier that is strongest on capacity but only average on fault-response time.
The operator's hesitation is here: when a new supplier is added to the evaluation next year, as long as the fixed bounds and the target do not change, the distance of these three suppliers relative to one another will not change; this is what gives the multi-year comparison its reliability. However, if technology in the sector is advancing rapidly, the target (ESP) needs to be reviewed every year against the definition of "acceptable for this year"; otherwise a comparison made against a target set two years ago loses its currency.
In the report: "Suppliers have been ranked using the fixed bounds and this year's target; the target (ESP) must be reviewed separately each year against sector conditions, otherwise the comparison is being made against an outdated standard."
3. What Not to Do
The first error is entering the ESP outside the fixed bound in the illustrative example, for instance 8.0 for performance; the source paper explicitly requires the ESP to stay within the fixed bound, otherwise the distance calculation becomes undefined. The second error is seeing that two alternatives fall between the ESP and the ISP on a criterion at α = 0.5 and looking for a "fine difference" there; by the theorem, that criterion's contribution in this region is independent of the alternatives' position, so no fine difference exists there. The third error is reading the distance value the way TOPSIS's closeness score is read, "the higher one wins," rather than as in the SPOTIS family, and placing T2 (the highest distance) first.
Sources
For the formulas behind each step, the intermediate tables and citation formats, see the DecisionMind method page: decisionmind.app/library/balanced-spotis
Shekhovtsov, A., Dezert, J., & Sałabun, W. (2025). Enhancing personalized decision-making with the Balanced SPOTIS algorithm. In Proceedings of the 17th International Conference on Agents and Artificial Intelligence (ICAART 2025), Vol. 3, 264–271. DOI: 10.5220/0013119800003890
Dezert, J., Tchamova, A., Han, D., & Tacnet, J. M. (2020). The SPOTIS rank reversal free method for multi-criteria decision-making support. In 2020 IEEE 23rd International Conference on Information Fusion (FUSION) (pp. 1–8). IEEE. DOI: 10.23919/FUSION45008.2020.9190347
Hwang, C. L., & Yoon, K. (1981). Multiple Attribute Decision Making: Methods and Applications: A State-of-the-Art Survey. Lecture Notes in Economics and Mathematical Systems, Vol. 186. Springer-Verlag. DOI: 10.1007/978-3-642-48318-9