Grey-SAW: Grey extension of SAW

Overview

Grey outranking/ranking: Grey Interval Number (GIN: [x̲, x̄]). Output typically utility (higher value = preferred).

Strengths

• •Method-specific: Grey outranking/ranking: Grey Interval Number (GIN: [x̲, x̄])
• •Preserves grey uncertainty through the pipeline rather than premature crispification at elicitation
• •Native group-decision support (multi-DM aggregation built into the pipeline)

Limitations

• •Assumes: Decision matrix entries are valid Grey numbers/tuples
• •Assumes: Underlying crisp method's compensation assumption holds in uncertain space
• •Assumes: All decision-maker(s) and experts use the same linguistic/uncertainty scale

Assumptions to verify

• •Decision matrix entries are valid Grey numbers/tuples
• •Underlying crisp method's compensation assumption holds in uncertain space
• •All decision-maker(s) and experts use the same linguistic/uncertainty scale

When not to use

• •Crisp data sufficient: use base SAW directly (avoid unnecessary uncertainty layer)
• •Aggregation operator (PFWA/PFOWA/etc.) not specified: output ambiguous

Edge cases

• •See F.steps and D.parameters for GREY-SAW-specific edge handling. recommendation_metadata.assumptions_to_verify also lists boundary conditions.

Common pitfalls

• •Hatalı: 'GREY-SAW bu varsayımı kontrol etmeden uygulamak'. Doğrusu: Decision matrix entries are valid Grey numbers/tuples
• •Hatalı: 'GREY-SAW bu varsayımı kontrol etmeden uygulamak'. Doğrusu: Underlying crisp method's compensation assumption holds in uncertain space
• •Hatalı: 'GREY-SAW bu varsayımı kontrol etmeden uygulamak'. Doğrusu: All decision-maker(s) and experts use the same linguistic/uncertainty scale
• •Hatalı: GREY-SAW'yi 'Crisp data sufficient' durumunda kullanmak: recommendation_metadata.not_recommended_when alternatif öneriyor.
• •Hatalı: GREY-SAW'yi 'Aggregation operator (PFWA/PFOWA/etc.) not specified' durumunda kullanmak: recommendation_metadata.not_recommended_when alternatif öneriyor.

Worked example

1. 1.Adım 1 (F1): Step 1: Construct grey matrix ⊗v_ij=[v_ij^L, v_ij^U]; normalize benefit/cost; whiten: v̂_ij=½(v_ij^L+v_ij^U). Formül: \otimes v_{ij}=[v_{ij}^L,v_{ij}^U];\\ \text{benefit: }\hat{v}_{ij}=\tfrac{1}{2}\Bigl(\frac{v_{ij}^L}{\max_k v_{kj}^U}+\frac{v_{ij}^U}{\max_k v_{kj}^U}\Bigr);\\ \text{cost: }\hat{v}_{ij}=\tfrac{1}{2}\Bigl(\frac{\min_k v_{kj}^L}{v_{ij}^U}+\frac{\min_k v_{kj}^L}{v_{ij}^L}\Bigr) Anchor: Fishburn 1967; Deng 1989
2. 2.Adım 2 (F2): Step 2: Weighted sum score S_i = Σ_j w_j·v̂_ij. Formül: S_i=\sum_{j=1}^n w_j\hat{v}_{ij} Anchor: Fishburn 1967 §SAW
3. 3.Adım 3 (F3): Step 3: Rank descending by S_i. Best: max S_i. Formül: \text{rank descending by }S_i Anchor: Fishburn 1967 §SAW ranking

Commonly paired with

• •n_a + GREY-SAW (common)

How to cite