This page is published in English.
Ranking
ERVD - Election based on Relative Value Distances
Prospect-theory value function with reference-point separation
Shyur, H. J., Yin, L., Shih, H. S., Cheng, C. B.2015doi:10.1515/fcds-2015-0017 ↗
Overview
φ_i ∈ [0,1]. Higher = better (closer to PIS). Behaviorally grounded: losses are weighted more heavily than gains (λ=2.25 default). Reference point strongly affects results - choose carefully.
- Data
- Crisp
- Weights
- Needs a weight source
How it works
- 1
Sum normalization (direction-unaware): r_ij = x_ij / Σ_k x_kj. Reference point also normalized: φ_j = μ_j / Σ_k x_kj.
Shyur et al. 2015 §3
- 2
Prospect-theory value function v_ij relative to normalized reference φ_j. For benefit (type=max): v_ij = (r_ij − φ_j)^α if r_ij > φ_j, else −λ(φ_j − r_ij)^α. For cost (type=min): v_ij = (φ_j − r_ij)^α if r_ij < φ_j, else −λ(r_ij − φ_j)^α.
Shyur et al. 2015 §3
- 3
Positive ideal A+_j = max_i v_ij; negative ideal A-_j = min_i v_ij per criterion. Separation measures S+_i = Σ w_j |v_ij − A+_j|; S-_i = Σ w_j |v_ij − A-_j|.
Shyur et al. 2015 §3
- 4
Relative closeness φ_i = S-_i / (S+_i + S-_i). Rank descending (higher = better).
Shyur et al. 2015 §3
Edge cases and pitfalls
- •if r_ij > φ_j, else −λ(φ_j − r_ij)^α. For cost (type=min): v_ij = (φ_j − r_ij)^α if r_ij < φ_j, else −λ(r_ij − φ_j)^α.
Sum normalization is direction-unaware - all columns summed as-is. Ref point normalized by same column sum. Cost direction handled in value function F2, not in normalization.
Alpha default is 0.88 (Kahneman-Tversky), NOT 2.25. Lambda default is 2.25.
How to cite
Shyur, H. J.; Yin, L.; Shih, H. S.; Cheng, C. B. (2015). A multiple criteria decision making method based on relative value distances. Foundations of Computing and Decision Sciences. https://doi.org/10.1515/fcds-2015-0017
System ID, as it appears in reports and the API
ERVD