z-logo
Premium
An interindividual iterative consensus model for fuzzy preference relations
Author(s) -
Xu Yejun,
Gao Pengqun,
Martínez Luis
Publication year - 2019
Publication title -
international journal of intelligent systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.291
H-Index - 87
eISSN - 1098-111X
pISSN - 0884-8173
DOI - 10.1002/int.22122
Subject(s) - consistency (knowledge bases) , preference , similarity (geometry) , computer science , degree (music) , group decision making , fuzzy logic , measure (data warehouse) , process (computing) , index (typography) , mathematical optimization , iterative and incremental development , mathematics , data mining , artificial intelligence , statistics , psychology , social psychology , physics , software engineering , world wide web , acoustics , image (mathematics) , operating system
Consensus reaching models are widely used to derive a representative solution in group decision‐making problems. Current models present limitations regarding the achievement of the agreement and keeping enough consistency for achieving valid solutions. Therefore, this paper proposed a new consensus model based on the deviation degree of two fuzzy preference relations (FPRs), in which a novel consistency index (CI) is defined to measure whether an FPR is of acceptable consistency. Additionally, an interindividual similarity index (ISI) is devised to measure the consensus degree of two FPRs. In the proposed consensus reaching process, ISI is also used to guide the two most incompatible decision‐makers (DMs) to modify their judgments. The proposed iterative consensus reaching algorithm is convergent, CI preservation. After that, a stationary vector method is adopted to determine DMs’ weights for the aggregation process based on DMs’ opinion transition probabilities. Finally, an illustrative example and comparative analysis is given to demonstrate the effectiveness of the proposed model.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here