Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
140 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Best-Worst Disaggregation: An approach to the preference disaggregation problem (2410.12678v2)

Published 16 Oct 2024 in math.OC

Abstract: Preference disaggregation methods in Multi-Criteria Decision-Making (MCDM) often encounter challenges related to inconsistency and cognitive biases when deriving a value function from experts' holistic preferences. This paper introduces the Best-Worst Disaggregation (BWD) method, a novel approach that integrates the principles of the Best-Worst Method (BWM) into the disaggregation framework to enhance the consistency and reliability of derived preference models. BWD employs the "consider-the-opposite" strategy from BWM, allowing experts to provide two opposite pairwise comparison vectors of alternatives. This approach reduces cognitive load and mitigates anchoring bias, possibly leading to more reliable criteria weights and attribute value functions. An optimization model is formulated to determine the most suitable additive value function to the preferences expressed by an expert. The method also incorporates a consistency analysis to quantify and improve the reliability of the judgments. Additionally, BWD is extended to handle interval-valued preferences, enhancing its applicability in situations with uncertainty or imprecise information. We also developed an approach to identify a reference set, which is used for pairwise comparisons to elicit the value functions and weights. A case study in logistics performance evaluation demonstrates the practicality and effectiveness of BWD, showing that it produces reliable rankings aligned closely with experts' preferences.

Summary

We haven't generated a summary for this paper yet.

X Twitter Logo Streamline Icon: https://streamlinehq.com