Extension card · Spherical
Spherical fuzzy WPM (Kutlu Gündoğdu and Yörükoğlu, 2021)
Spherical fuzzy WPM is the form of WPM used when criterion scores are given as three separate numbers stating a degree of support, rejection and hesitancy for a judgement. The calculation first reduces every cell to a single number, then multiplies these numbers together with weights.
Base method
WPM →
Philosophy, mechanics, strengths and weaknesses are on the base method card; this card describes only the difference.
Data type (family)
Spherical →
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?
Three things change. The decision logic does not.
Cells. In crisp WPM every cell is a single number. In the spherical fuzzy form every cell consists of three degrees: support (μ), rejection (ν) and hesitancy (π). The expert supplies all three directly. The only constraint is that the sum of the three degrees' squares cannot exceed 1. Weights come from outside DecisionMind as crisp numbers; the method does not generate weights, nor does it support the group-decision step that merges several experts' judgements.
Scale equalisation. Crisp WPM scales every column against its own best value. In the spherical fuzzy form, every cell is instead reduced to a single number with the source chapter's own score function: Score(α) = (3μ − π/2)² − (ν − π/2)². This corresponds not to crisp WPM's scaling but to SF-SAW's own crisping step; the first four steps of SF-WPM are identical to those of SF-SAW, since both come from the same chapter.
Weighted product. In crisp WPM every column is raised to the power of its weight and multiplied along the row: SV_i = Π_j x̄_ij^{w_j}. The same operation is applied here; the difference is that x̄_ij is now a score already crisped from three degrees. This is the one step that separates SF-WPM from SF-SAW: SF-SAW multiplies these same x̄_ij values by the weight and sums them, whereas SF-WPM raises them to the power of the weight and multiplies them.
Result and the negative-score issue. The Score(α) formula can come out negative for certain combinations of μ, ν and π; even in the source chapter's own example, the two worst linguistic terms ("very poor," "extremely poor") produce a negative score. When this happens, the kernel clips any cell that comes out negative or zero to a very small constant (1e-12). Otherwise, raising a negative base to a fractional exponent (the weight) is undefined in the real numbers. This clipping destroys information: every clipped cell converges on the same constant, so how poor the cell actually was (−0.66 or −0.94) never reaches the result. DecisionMind does not hide this; the kernel reports every clipping as a separate warning and states that the ranking of the affected alternatives is unreliable.
How to Read the Output
The total product (SV) is read as in crisp WPM: it only ranks alternatives within this particular set, is not a percentage, and cannot be compared with a different analysis. The difference is here. SV is a value that has been crisped per cell and then multiplied; how the hesitancy share feeds into the score is not directly visible.
More importantly, if any alternative's Score(α) value on any criterion has fallen to zero or below, the report must state this separately. In that case, that cell has been clipped to EPS, and the alternative's total SV carries only the information "it was clipped," not the true magnitude of the weakness on that criterion.
Thus instead of writing:
"A high SV in SF-WPM shows the alternative stayed strong on every criterion"
the report should read:
"A high SV shows that Score(α) did not fall to zero or below on any criterion and that the product reflects genuine magnitudes. If a clipping warning exists on a criterion, only the affected alternative's position in the ranking should be read cautiously, not the size of its SV"
When to Prefer This over the Base Method
Use this extension when experts give the degrees of support, rejection and hesitancy for a judgement separately. If these three pieces of information run too high to fit the picture fuzzy structure's constraint, the spherical fuzzy form is needed. A measured criterion is not expanded into three degrees by force. The boundary that must not be confused with neighbouring types (Pythagorean, picture fuzzy) is set out on the data-type card.
Crisp WPM's severity applies doubly here. If a criterion's Score(α) sits just above zero, the product already penalises that criterion harshly; if it falls below zero, clipping takes over and that criterion loses almost all its discriminating power. If no compromise at all is acceptable on one criterion, this extension is still compensatory; the SAW family's exit condition applies here too.
Mistakes Specific to This Extension
Ignoring the clipping warning. The kernel reports every clipping when it happens. If this warning is ignored and SV values are compared directly, the affected alternative's true weakness appears at a different magnitude than it actually is.
Confusing the value-space constraint. The constraint is the sum of the squares of the three degrees: μ²+ν²+π²≤1. It is not the sum of the three degrees themselves; that is the picture fuzzy structure's constraint.
Changing the score function. Every cell is crisped with the source chapter's own score function. Carrying over the Pythagorean family's or another family's score function gives a different score, and in some tables a different rank.
Failing to apply the cost direction. If the support and rejection degrees are not swapped on a "lower is better" criterion, the score is computed in the wrong direction. The worst alternative on that criterion then looks like the best.
The governing principle is this:
SF-WPM's multiplicative step operates on crisped per-cell scores, and these scores can be negative. A negative score is resolved by clipping, but clipping loses information; this loss must be shown in the report together with the warning, not passed over silently.
Cases
The first case is DecisionMind's validation example. The same 3×3 table is also used in the SF-SAW card's Case 1. It is not the source chapter's own numerical example (an insurance-option assessment); it has been built by running the engine itself, faithfully to the formulas, in a way that suits presenting the two methods comparatively within the chapter. The second case is an illustrative construction.
1. Illustrative example: Spherical fuzzy assessment of three alternatives on three criteria (DecisionMind validation example)
Three alternatives are assessed with spherical fuzzy triples on three criteria; all three are "higher is better" criteria. Weights are crisp numbers.
| Alternative | K1 | K2 | K3 |
|---|---|---|---|
| A1 | (0.70; 0.20; 0.50) | (0.80; 0.10; 0.40) | (0.60; 0.30; 0.50) |
| A2 | (0.90; 0.10; 0.30) | (0.60; 0.30; 0.60) | (0.80; 0.20; 0.40) |
| A3 | (0.50; 0.40; 0.60) | (0.70; 0.20; 0.50) | (0.70; 0.10; 0.50) |
| Weight | 0.40 | 0.35 | 0.25 |
The method reduces every cell to a single number with the formula Score(α) = (3μ−π/2)²−(ν−π/2)², then raises these numbers to the power of the criterion weight and multiplies them. In this table no cell falls to zero or below; clipping does not come into play.
| Alternative | Weighted product (SV) | Rank |
|---|---|---|
| A2 | 4.1652 | 1 |
| A1 | 3.5322 | 2 |
| A3 | 2.4094 | 3 |
The result reads as follows. A2 has the highest Score(α) value (6.50) on K1 (0.40), the most heavily weighted criterion, and this advantage carries through the product with a clear margin over the others. A1 is strong on the second criterion (0.80; 0.10; 0.40) but trails A2 on K1. A3 is not the best on any criterion and finishes last.
The board's hesitation is this: if K1's weight is lowered from 0.40 to 0.28 and K2's raised from 0.35 to 0.47 (with K3 fixed at 0.25), A1 moves ahead: A1 = 3.6816, A2 = 3.6674. This has been independently verified in Python by running the engine itself. A2's first place depends on K1 remaining noticeably heavier than K2.
In the report: "With the given weights (K1=0.40; K2=0.35; K3=0.25), A2 has obtained the highest weighted product (4.1652). If K1's weight is brought closer to K2's (K1=0.28; K2=0.47), A1 moves ahead; the ranking is sensitive to how much heavier K1 is kept relative to K2."
Source: DecisionMind's SF-WPM validation example. The steps rest on the SVWPM algorithm (Equations 34–35) from Kutlu Gündoğdu and Yörükoğlu's (2021) book chapter; the figures were independently calculated by this card's author by running the kernel directly.
2. Education: A university's choice of online-education platform supplier
A university will choose one of three platform suppliers (A1, A2, A3) for its distance-education infrastructure. Three criteria have been set: technical stability and accessibility, instructional-design support, and integration cost (the last of these is "lower is better"). The evaluation committee answered three separate questions for every supplier: "adequate" (support), "inadequate" (rejection) and "no decision without seeing a pilot" (hesitancy); all three could be marked at once.
The method swaps the support and rejection degrees on the integration-cost criterion, crisps every supplier's triple on the three criteria with Score(α), and computes the weighted product. Suppose a supplier that received strong support on technical stability but on which the committee remained undecided on integration cost came out first, while a supplier strong on instructional-design support but weak on technical stability came second.
The university's hesitation is this: the high hesitancy share on the integration-cost criterion for the first-ranked supplier has dissolved inside the weighted product. Before signing a contract, the university should separately ask where this hesitancy comes from, whether it is unsettled licence pricing or unclear integration timelines.
In the report: "The supplier that is strongest on technical stability is ranked first. This supplier's hesitancy share on the integration-cost criterion has remained higher than on the other criteria and should be clarified separately before signing a contract."
3. What Not to Do
In the illustrative example, ignoring the hesitancy degree (π) and running an intuitionistic fuzzy calculation with only the support and rejection degrees gives different scores, and can make A2's advantage on K1 look larger or smaller than it is. The second error is continuing the calculation without noticing when Score(α) comes out negative on a criterion, and never stating the clipping warning in the report; in that case the magnitude of SV becomes misleading for the affected alternative. The third error is changing A1's triple on K2, (0.80; 0.10; 0.40), to a value such as (0.80; 0.10; 0.60) without checking the constraint; the sum of the squares becomes 0.64+0.01+0.36=1.01, exceeding the constraint.
Sources
For the formulas behind each step, the intermediate tables and citation formats, see the DecisionMind method page: decisionmind.app/library/sf-wpm
Miller, D. W., & Starr, M. K. (1969). Executive Decisions and Operations Research. Prentice-Hall. (no DOI; the founding source for crisp WPM)
Kutlu Gündoğdu, F., & Yörükoğlu, M. (2021). Simple additive weighting and weighted product methods using spherical fuzzy sets. In C. Kahraman & F. Kutlu Gündoğdu (Eds.), Decision Making with Spherical Fuzzy Sets: Theory and Applications (Studies in Fuzziness and Soft Computing, Vol. 392, pp. 241–258). Springer. DOI: 10.1007/978-3-030-45461-6_10
Kutlu Gündoğdu, F., & Kahraman, C. (2019). Spherical fuzzy sets and spherical fuzzy TOPSIS method. Journal of Intelligent & Fuzzy Systems, 36(1), 337–352. DOI: 10.3233/JIFS-181401