Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao IEEE Transactions on...arrow_drop_down
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
IEEE Transactions on Fuzzy Systems
Article . 2020 . Peer-reviewed
License: IEEE Copyright
Data sources: Crossref
DBLP
Article . 2020
Data sources: DBLP
versions View all 2 versions
addClaim

Iterative Algorithms to Manage the Consistency and Consensus for Group Decision-Making With Hesitant Multiplicative Preference Relations

Authors: Zhiming Zhang 0002; Witold Pedrycz;

Iterative Algorithms to Manage the Consistency and Consensus for Group Decision-Making With Hesitant Multiplicative Preference Relations

Abstract

In this article, we study how to manage the consistency and consensus in group decision-making (GDM) with hesitant multiplicative preference relations (HMPRs). First, an approach to develop the priority weight vector of an HMPR is presented. Then, the consistency index of an HMPR is defined for its consistency checking. Subsequently, we define an acceptable consistent HMPR and propose an iterative procedure to improve the consistency of an unacceptable consistent HMPR. As to the GDM with HMPRs, distance measures and proximity degrees are defined to derive the weights of the decision makers (DMs). Moreover, a consensus index is proposed for measuring the agreement degree of different DMs’ judgments, and an iterative approach is offered to implement the consensus reaching process. In the sequel, an algorithm to GDM with HMPRs is put forward. Two numerical examples are covered to highlight the merits of the proposed algorithms.

  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    17
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Top 10%
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Average
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Top 10%
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
17
Top 10%
Average
Top 10%
Upload OA version
Are you the author of this publication? Upload your Open Access version to Zenodo!
It’s fast and easy, just two clicks!