An optimal feedback model to prevent manipulation behaviours in consensus under social network group decision making

The file attached to this record is the author's final peer reviewed version. The Publisher's final version can be found by following the DOI link.A novel framework to prevent manipulation behaviour in consensus reaching process under social network group decision making is proposed, which is based on a theoretically sound optimal feedback model. The manipulation behaviour classification is twofold: (1) ‘individual manipulation’ where each expert manipulates his/her own behaviour to achieve higher importance degree (weight); and (2) ‘group manipulation’ where a group of experts force inconsistent experts to adopt specific recommendation advices obtained via the use of fixed feedback parameter. To counteract ‘individual manipulation’, a behavioural weights assignment method modelling sequential attitude ranging from ‘dictatorship’ to ‘democracy’ is developed, and then a reasonable policy for group minimum adjustment cost is established to assign appropriate weights to experts. To prevent ‘group manipulation’, an optimal feedback model with objective function the individual adjustments cost and constraints related to the threshold of group consensus is investigated. This approach allows the inconsistent experts to balance group consensus and adjustment cost, which enhances their willingness to adopt the recommendation advices and consequently the group reaching consensus on the decision making problem at hand. A numerical example is presented to illustrate and verify the proposed optimal feedback model

Algorithms to Detect and Rectify Multiplicative and Ordinal Inconsistencies of Fuzzy Preference Relations

The file attached to this record is the author's final peer reviewed version. The Publisher's final version can be found by following the DOI link.Consistency, multiplicative and ordinal, of fuzzy preference relations (FPRs) is investigated. The geometric consistency index (GCI) approximated thresholds are extended to measure the degree of consistency for an FPR. For inconsistent FPRs, two algorithms are devised (1) to find the multiplicative inconsistent elements, and (2) to detect the ordinal inconsistent elements. An integrated algorithm is proposed to improve simultaneously the ordinal and multiplicative consistencies. Some examples, comparative analysis, and simulation experiments are provided to demonstrate the effectiveness of the proposed methods

An overview on managing additive consistency of reciprocal preference relations for consistency-driven decision making and Fusion: Taxonomy and future directions

The file attached to this record is the author's final peer reviewed version. The Publisher's final version can be found by following the DOI link.The reciprocal preference relation (RPR) is a powerful tool to represent decision makers’ preferences in decision making problems. In recent years, various types of RPRs have been reported and investigated, some of them being the ‘classical’ RPRs, interval-valued RPRs and hesitant RPRs. Additive consistency is one of the most commonly used property to measure the consistency of RPRs, with many methods developed to manage additive consistency of RPRs. To provide a clear perspective on additive consistency issues of RPRs, this paper reviews the consistency measurements of the different types of RPRs. Then, consistency-driven decision making and information fusion methods are also reviewed and classified into four main types: consistency improving methods; consistency-based methods to manage incomplete RPRs; consistency control in consensus decision making methods; and consistency-driven linguistic decision making methods. Finally, with respect to insights gained from prior researches, further directions for the research are proposed

A Local Adjustment Method to Improve Multiplicative Consistency of Fuzzy Reciprocal Preference Relations

The file attached to this record is the author's final peer reviewed version. The Publisher's final version can be found by following the DOI link.Preferences that verify the transitivity property are usually referred to as rational or consistent preferences. Existent methods to improve the consistency of inconsistent fuzzy reciprocal preference relations (FPRs) fail to retain the original preference values because they always derive a new FPR. This article presents a new inconsistency identification and modification (IIM) method to detect and rectify only the most inconsistent elements of an inconsistent FPR. As such, the proposed IIM can be considered a local adjustment method to improve multiplicative consistency (MC) of FPRs. The case of inconsistent FPRs with missing values, i.e., incomplete FPRs, is addressed with the estimation of the missing preferences with a constrained nonlinear optimization model by the application of the IIM method. The implementation process of the proposed algorithms is illustrated with numerical examples. Simulation experiments and comparisons with existent methods are also included to show that the new method requires fewer iterations than existent methods to improve the MC of FPRs and achieves better MC level, while preserving the original preference information as much as possible than the existent methods. Thus, the results presented in this article demonstrate the correctness, effectiveness, and robustness of the proposed method

A chi-square method for priority derivation in group decision making with incomplete reciprocal preference relations

This paper proposes a chi-square method (CSM) to obtain a priority vector for group decision making (GDM) problems where decision-makers’ (DMs’) assessment on alternatives is furnished as incomplete reciprocal preference relations with missing values. Relevant theorems and an iterative algorithm about CSM are proposed. Saaty’s consistency ratio concept is adapted to judge whether an incomplete reciprocal preference relation provided by a DM is of acceptable consistency. If its consistency is unacceptable, an algorithm is proposed to repair it until its consistency ratio reaches a satisfactory threshold. The repairing algorithm aims to rectify an inconsistent incomplete reciprocal preference relation to one with acceptable consistency in addition to preserving the initial preference information as much as possible. Finally, four examples are examined to illustrate the applicability and validity of the proposed method, and comparative analyses are provided to show its advantages over existing approaches

Predicting missing pairwise preferences from similarity features in group decision making

In group decision-making (GDM), fuzzy preference relations (FPRs) refer to pairwise preferences in the form of a matrix. Within the field of GDM, the problem of estimating missing values is of utmost importance, since many experts provide incomplete preferences. In this paper, we propose a new method called the entropy-based method for estimating the missing values in the FPR. We compared the accuracy of our algorithm for predicting the missing values with the best candidate algorithm from state of the art achievements. In the proposed entropy-based method, we took advantage of pairwise preferences to achieve good results by storing extra information compared to single rating scores, for example, a pairwise comparison of alternatives vs. the alternative’s score from one to five stars. The entropy-based method maps the prediction problem into a matrix factorization problem, and thus the solution for the matrix factorization can be expressed in the form of latent expert features and latent alternative features. Thus, the entropy-based method embeds alternatives and experts in the same latent feature space. By virtue of this embedding, another novelty of our approach is to use the similarity of experts, as well as the similarity between alternatives, to infer the missing values even when only minimal data are available for some alternatives from some experts. Note that current approaches may fail to provide any output in such cases. Apart from estimating missing values, another salient contribution of this paper is to use the proposed entropy-based method to rank the alternatives. It is worth mentioning that ranking alternatives have many possible applications in GDM, especially in group recommendation systems (GRS).Andalusian Government P20 00673 PID2019-103880RB-I00 MCIN/AEI/10.13039/50110001103

Granular computing and optimization model-based method for large-scale group decision-making and its application

In large-scale group decision-making process, some decision makers hesitate among several linguistic terms and cannot compare some alternatives, so they often express evaluation information with incomplete hesitant fuzzy linguistic preference relations. How to obtain suitable large-scale group decision-making results from incomplete preference information is an important and interesting issue to concern about. After analyzing the existing researches, we find that: i) the premise that complete preference relation is perfectly consistent is too strict, ii) deleting all incomplete linguistic preference relations that cannot be fully completed will lose valid assessment information, iii) semantics given by decision makers are greatly possible to be changed during the consistency improving process. In order to solve these issues, this work proposes a novel method based on Granular computing and optimization model for large-scale group decision-making, considering the original consistency of incomplete hesitant fuzzy linguistic preference relation and improving its consistency without changing semantics during the completion process. An illustrative example and simulation experiments demonstrate the rationality and advantages of the proposed method: i) semantics are not changed during the consistency improving process, ii) completion process does not significantly alter the inherent quality of information, iii) complete preference relations are globally consistent, iv) final large-scale group decision-making result is acquired by fusing complete preference relations with different weights

Intentional bounded rationality methodology to assess the quality of decision-making approaches with latent alternative performances

Expert’s judgments have been crucial in the development of decision theory; however, what criterion to use in the selection of experts remains an issue to address. Decision support techniques proposed to improve the quality of expert judgment decision making consider a demonstrated inconsistency of the judgments expressed by an expert as a criterion of exclusion in the decision-making process of such expert. Although consistency appears to be a desirable condition to qualify as “expert”, little is known about the quality of the decisions made imposing consistency as the expert qualifying condition. This paper proposes a simulation methodology, based on an automaton programmed to make decisions in an intended but bounded rational way, to assess the cost-benefit of different aspects of decision support techniques. Within this methodology, the imposition of the consistency condition in the selection of experts is studied. In particular, the paper shows with a case study example that the Analytical hierarchy process (AHP) decision support technique expected payoff is at most 5% higher when implementing Saaty’s consistency criterion of the expert’s judgments than when the consistency criterion is not considered.Spanish Government ECO2017-86305-C4-3-RGobierno de AragonEuropean Social Fund (ESF)Spanish Government PID2019-103880RB-I00/AEI/10.13039/50110001103

A systematic review on multi-criteria group decision-making methods based on weights: analysis and classification scheme

Interest in group decision-making (GDM) has been increasing prominently over the last decade. Access to global databases, sophisticated sensors which can obtain multiple inputs or complex problems requiring opinions from several experts have driven interest in data aggregation. Consequently, the field has been widely studied from several viewpoints and multiple approaches have been proposed. Nevertheless, there is a lack of general framework. Moreover, this problem is exacerbated in the case of experts’ weighting methods, one of the most widely-used techniques to deal with multiple source aggregation. This lack of general classification scheme, or a guide to assist expert knowledge, leads to ambiguity or misreading for readers, who may be overwhelmed by the large amount of unclassified information currently available. To invert this situation, a general GDM framework is presented which divides and classifies all data aggregation techniques, focusing on and expanding the classification of experts’ weighting methods in terms of analysis type by carrying out an in-depth literature review. Results are not only classified but analysed and discussed regarding multiple characteristics, such as MCDMs in which they are applied, type of data used, ideal solutions considered or when they are applied. Furthermore, general requirements supplement this analysis such as initial influence, or component division considerations. As a result, this paper provides not only a general classification scheme and a detailed analysis of experts’ weighting methods but also a road map for researchers working on GDM topics or a guide for experts who use these methods. Furthermore, six significant contributions for future research pathways are provided in the conclusions.The first author acknowledges support from the Spanish Ministry of Universities [grant number FPU18/01471]. The second and third author wish to recognize their support from the Serra Hunter program. Finally, this work was supported by the Catalan agency AGAUR through its research group support program (2017SGR00227). This research is part of the R&D project IAQ4EDU, reference no. PID2020-117366RB-I00, funded by MCIN/AEI/10.13039/ 501100011033.Peer ReviewedPostprint (published version