DIBR - Defining Interrelationships Between Ranked criteria

Overview

DIBR requires n−1 adjacent relationship shares (no full pairwise matrix). For ranked adjacent criteria, γ is the lower-ranked criterion's share and w_{j+1}/w_j=γ/(1−γ).

Output

Weight, higher is better

Data

Crisp, expert input required

Weights

Derived internally, no weight source needed

Size

2+ alternatives, 3-12 criteria works best

Used for

Expert-driven decision making, MAGDM

How it works

1. 1

   Kriterleri C_1 ≻ C_2 ≻ … ≻ C_n olarak sırala. Anchor: Pamučar et al. 2021, DIBR procedure.

2. 2

   Her komşu çift için alt sıradaki kriterin payı γ_{j,j+1} ile w_{j+1}/w_j=γ_{j,j+1}/(1−γ_{j,j+1}) ilişkisini kur.

3. 3

   Göreli ağırlıkları ardışık üret, toplamları 1 olacak biçimde normalize et ve özgün kriter sırasına geri yerleştir.

Fits when / Look elsewhere when

Assumptions to verify

• Domain experts available
• Experts can express consistent comparisons

Edge cases and pitfalls

• γ=0 or γ>0.5 is invalid for a strict best-to-worst order; each adjacent share must be in (0,0.5].

Works with

How to cite