Search arXivSearch

arXiv · 2509.08187

A Comparative Analysis of Multi-Criteria Decision-Making (MCDM) Methods

Abstract

Multi-Criteria Decision-Making (MCDM) techniques have found widespread application across diverse fields. The rapid evolution of MCDM has led to the development of hundreds of methods, each employing distinct approaches. However, due to inherent algorithmic differences, various MCDM methods often yield divergent results when applied to the same specific problem. This study undertakes a comparative analysis of four particular methods: RAM, MOORA, FUCA, and CURLI, within a defined case study. The evaluation context involves ranking 30 Vietnamese banks based on six criteria: capital adequacy, asset quality, management capability, earnings ability, liquidity, and sensitivity to market risk. Prior to this analysis, these banks had also been ranked by the CAMELS rating system. The CAMELS rankings serve as a benchmark to assess the performance of the RAM, MOORA, FUCA, and CURLI methods. Our findings indicate that FUCA and CURLI are highly suitable methods for this application, demonstrating Spearman's rank correlation coefficients with CAMELS of 0.9996 and 0.9984, respectively. In contrast, both RAM and MOORA proved unsuitable, exhibiting very low Spearman's correlation coefficients of -1.0296 against the CAMELS ranking.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Nguyen Thi Thu Hien, Pham Huong Quynh, Vu Quang Minh. 2025-09-09. A Comparative Analysis of Multi-Criteria Decision-Making (MCDM) Methods. https://doi.org/10.48084/etasr.12782

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

See You at the Posterior Line: Learning Bayesian Modeling Through a Car Racing Game

We present an interactive classroom activity designed to address a central challenge in teaching introductory Bayesian statistics: how to formalize subjective knowledge and available information into prior distributions and then update them with empirical data. Role-playing as data analysts for a racing team, students evaluate candidate tires by converting qualitative engineering reports into prior distributions, collecting primary data via a virtual racing game, and using a Beta-Binomial model to inform team strategy. This discovery-based exercise allows small groups to observe directly how different prior choices and sample data jointly shape posterior inference. Student feedback ($n=32$) highlights high enjoyment, engagement and improved conceptual clarity. Open-access materials to implement the activity are provided, alongside recommendations for adapting it to other teaching contexts.

stat.OT

Why is Regularization Underused? An Empirical Study on Trust and Adoption of Statistical Methods

Statistical practice does not automatically follow methodological innovation. Regularization methods, widely advocated to reduce overfitting and stabilize inference, are readily available in modern software, but are not consistently used by data analysts. We investigate this implementation gap in a large-scale empirical study of trust in, and acceptance of, regularization techniques, based on $N = 606$ data analysts. Drawing on measurement frameworks from technology acceptance research, we survey practitioners and embed a randomized experiment to test whether written recommendation of regularization methods increases trust or intended use. We find no evidence of such an effect. Instead, adoption intentions are strongly associated with analysts' perceptions of ease of implementation and practical benefit, such as improved bias control or interpretability. Perceived social norms also emerge as a central driver. These results indicate that uptake of statistical methodology depends less on formal recommendations than on usability, perceived utility, and community practice.

stat.OT

Exact analysis of a split--merge queue with latent Erlang-factor dependent subtask times

This paper studies a two-server split--merge queue with positively dependent subtask service times modeled through a latent-factor bivariate Erlang construction. An exact characterization of the split--merge completion time is obtained, including explicit formulas for its first two moments and the resulting mean waiting time. Under fixed marginal service-time distributions, independence is shown to stochastically increase the completion time and hence overestimate mean waiting time. Numerical illustrations show that this benchmark gap can be substantial.

stat.OT