IF-MAUT: Intuitionistic Fuzzy Multi-Attribute Utility Theory (IFWA-based additive utility)

Overview

Aggregation-operator-based additive ranking under Intuitionistic Fuzzy uncertainty (IFN: μ, ν; μ+ν ≤ 1). Output typically utility_score (higher value = preferred).

Strengths

• •Method-specific: Aggregation-operator-based additive ranking under Intuitionistic Fuzzy uncertainty (IFN: μ, ν; μ+ν ≤ 1)
• •Preserves intuitionistic uncertainty through the pipeline rather than premature crispification at elicitation

Limitations

• •Assumes: Decision matrix entries are valid IFNs (μ+ν ≤ 1)
• •Assumes: Preferential independence: per-criterion utility is additively separable
• •Assumes: Criterion weights are crisp and sum to 1 (Xu 2007 IFWA assumption)
• •Assumes: Expert consensus on the IFN scale (e.g. mapping linguistic terms to (μ, ν) pairs)

Assumptions to verify

• •Decision matrix entries are valid IFNs (μ+ν ≤ 1)
• •Preferential independence: per-criterion utility is additively separable
• •Criterion weights are crisp and sum to 1 (Xu 2007 IFWA assumption)
• •Expert consensus on the IFN scale (e.g. mapping linguistic terms to (μ, ν) pairs)

When not to use

• •Crisp data sufficient: use base MAUT directly
• •Group decision-making with multiple DM weights needed: use IF-TOPSIS (Boran 2009) or extend with the outer IFWA loop
• •Strong interaction between criteria: additive utility assumption violated, consider Choquet integral-based IF-MADM
• •IF-SAW already used on the same problem: output is numerically identical, redundant

Edge cases

• •IF decision matrix R = (r_ij)_{m×n}, r_ij = (μ_ij, ν_ij).
• •tie-breaking on equal scores. H ∈ [0, 1]; higher H means lower hesitancy π = 1 − H.
• •if both S and H equal, the alternatives are equivalent under IFN comparison.

Common pitfalls

• •Hatalı: 'IF-MAUT bu varsayımı kontrol etmeden uygulamak'. Doğrusu: Decision matrix entries are valid IFNs (μ+ν ≤ 1)
• •Hatalı: 'IF-MAUT bu varsayımı kontrol etmeden uygulamak'. Doğrusu: Preferential independence: per-criterion utility is additively separable
• •Hatalı: 'IF-MAUT bu varsayımı kontrol etmeden uygulamak'. Doğrusu: Criterion weights are crisp and sum to 1 (Xu 2007 IFWA assumption)
• •Hatalı: 'IF-MAUT bu varsayımı kontrol etmeden uygulamak'. Doğrusu: Expert consensus on the IFN scale (e.g. mapping linguistic terms to (μ, ν) pairs)
• •Hatalı: IF-MAUT'yi 'Crisp data sufficient' durumunda kullanmak: recommendation_metadata.not_recommended_when alternatif öneriyor.
• •Hatalı: IF-MAUT'yi 'Group decision-making with multiple DM weights needed' durumunda kullanmak: recommendation_metadata.not_recommended_when alternatif öneriyor.
• •Hatalı: IF-MAUT'yi 'Strong interaction between criteria' durumunda kullanmak: recommendation_metadata.not_recommended_when alternatif öneriyor.

Worked example

1. 1.Adım 1 (F1): Step 1: Validate IFN axioms (μ+ν ≤ 1) on every matrix entry; verify crisp weights on the n-simplex (Σω=1). Construct the IF decision matrix R = (r_ij)_{m×n}, r_ij = (μ_ij, ν_ij). Formül: R = (r_{ij})_{m \times n},\ r_{ij} = (\mu_{ij}, \nu_{ij}),\ \mu_{ij} + \nu_{ij} \le 1,\ \pi_{ij} = 1 - \mu_{ij} - \nu_{ij} Anchor: Atanassov 1986 (IFS axioms); Xu 2007 §II
2. 2.Adım 2 (F2): Step 2: For each cost criterion j (direction='min'), complement entries via (μ_ij, ν_ij) → (ν_ij, μ_ij). Benefit criteria are unchanged. This converts every criterion to benefit-direction so that IFWA preserves preference semantics. Formül: \hat{r}_{ij} = \begin{cases} (\mu_{ij}, \nu_{ij}) & \text{if } j \text{ is benefit} \\ (\nu_{ij}, \mu_{ij}) & \text{if } j \text{ is cost} \end{cases} Anchor: Atanassov 1986 IFN complement; standard IF-MADM normalisation convention (e.g. Boran 2009 Step 5 cost branch)
3. 3.Adım 3 (F3): Step 3: For each alternative A_i, aggregate the row of n IFNs into a single utility IFN U_i using the Xu 2007 IFWA operator with crisp criterion weights ω. The IFWA closed form (Xu 2007 Eq. 12) gives U_i = (1 - ∏(1-μ_ij)^ω_j, ∏ ν_ij^ω_j). Formül: U_i = \text{IFWA}_{\omega}(\hat{r}_{i1}, \ldots, \hat{r}_{in}) = \left(1 - \prod_{j=1}^{n} (1 - \mu_{ij})^{\omega_j},\ \prod_{j=1}^{n} \nu_{ij}^{\omega_j}\right) Anchor: Xu 2007 Def 3.3 + Theorem 3.4 (Eqs. 11-12 IFWA closed form)
4. 4.Adım 4 (F4): Step 4: Compute the Chen-Tan 1994 score S(U_i) = μ_{U_i} − ν_{U_i} for each alternative. S(U_i) ∈ [−1, 1] is the primary defuzzified utility used for ranking. Formül: S(U_i) = \mu_{U_i} - \nu_{U_i} \in [-1, 1] Anchor: Chen & Tan 1994 score function; Xu 2007 Eq. (4)
5. 5.Adım 5 (F5): Step 5: Compute the Hong-Choi 2000 accuracy H(U_i) = μ_{U_i} + ν_{U_i} for tie-breaking on equal scores. H ∈ [0, 1]; higher H means lower hesitancy π = 1 − H. Formül: H(U_i) = \mu_{U_i} + \nu_{U_i} \in [0, 1] Anchor: Hong & Choi 2000 accuracy function; Xu 2007 Eq. (5)
6. 6.Adım 6 (F6): Step 6: Rank alternatives in descending order of the (S, H) lex pair per Xu 2007 Def 3.1: primary sort by S(U_i) descending; on equality of S, break ties by H(U_i) descending; if both S and H equal, the alternatives are equivalent under IFN comparison. Formül: A_i \succ A_k \iff S(U_i) > S(U_k) \text{ or } (S(U_i) = S(U_k) \land H(U_i) > H(U_k)) Anchor: Xu 2007 Def 3.1 (score-then-accuracy comparison)

Commonly paired with

• •ENTROPY + IF-MAUT (common)
• •CRITIC + IF-MAUT (occasional)

How to cite