Next Article in Journal
The Relationship between Fuzzy Reasoning Methods Based on Intuitionistic Fuzzy Sets and Interval-Valued Fuzzy Sets
Next Article in Special Issue
A Fuzzy Decision-Making Soft Model for Family Financial Planning in the Post-COVID-19 World
Previous Article in Journal
Modulation Transfer between Microwave Beams: A Hypothesized Case of a Classically-Forbidden Stochastic Process
Previous Article in Special Issue
An Explainable Machine Learning Framework for Forecasting Crude Oil Price during the COVID-19 Pandemic
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Incomplete Complex Intuitionistic Fuzzy System: Preference Relations, Expert Weight Determination, Group Decision-Making and Their Calculation Algorithms

1
College of Mathematics and Statistics, Northwest Normal University, Lanzhou 730070, China
2
Basic Subjects Department, Lanzhou Institute of Technology, Lanzhou 730050, China
3
School of Science, Chongqing University of Posts and Telecommunications, Chongqing 400065, China
*
Authors to whom correspondence should be addressed.
Axioms 2022, 11(8), 418; https://doi.org/10.3390/axioms11080418
Submission received: 18 July 2022 / Revised: 15 August 2022 / Accepted: 17 August 2022 / Published: 19 August 2022

Abstract

:
As is well known, complex intuitionistic fuzzy preference relation can describe the fuzzy characters of things in more detail and comprehensively and is very useful in dealing with decision-making problems that include periodic or recurring phenomena. However, sometimes, a decision-maker may provide incomplete judgments in a complex intuitionistic fuzzy preference relation because of a lack of knowledge, time pressure, and the decision-makers’ limited expertise related to the problem domain. In such cases, it would be sensible not to force the expert to express “false” preferences over these objects. Consequently, how to define incomplete complex intuitionistic fuzzy preference relations and to estimate their missing elements in an incomplete complex intuitionistic fuzzy preference relation becomes a necessary step in a decision-making process. In this paper, the concept of incomplete complex intuitionistic fuzzy preference relation is introduced and its properties are discussed. Meanwhile, the multiplicative consistent incomplete complex intuitionistic fuzzy preference relations are defined. Secondly, estimating algorithms are developed to estimate the missing elements in the acceptable incomplete complex intuitionistic fuzzy preference relations. Finally, an expert weight determination algorithm and the group decision-making algorithms based on incomplete complex intuitionistic fuzzy preference relations are established. The solving process of the algorithms is illustrated by an example, the practicability of the algorithms is verified, the advantages and disadvantages of two group decision-making algorithms are compared and analyzed, and the simulation verification of incomplete complex intuitionistic fuzzy system is carried out by MATLAB software. The framework proposed in this paper effectively generalizes and enriches the previous works and has a good application prospect.

1. Introduction

Preference relation, as one of the effective decision-making methods, has received great attention from researchers and has been widely applied in many practical decision-making fields, such as forecast projects, economic analysis, management information systems, decision support systems, and so on [1,2,3,4,5,6]. In the decision-making process, decision-makers provide their preference values over alternatives by comparing them pairwise and then constructing a preference relation. With the different types of decision-making problems, there exist distinct types of preference relations. Xu [7] gave a systematic and exhaustive survey of the existing preference relations, which mainly include multiplicative preference relations, fuzzy preference relations, linguistic preference relations, and intuitionistic preference relations. These four types of preference relations have been systematically investigated over the past decades and applied extensively in a variety of fields, such as medicine, economy, management, and military affairs [8,9,10,11,12,13,14,15,16,17,18,19,20,21,22].
Note that the above-cited studies of decision-making issues based on preference relations can only deal with one-dimensional decision-making problems. However, many real-world complex problems include two-dimensional data, that is, the properties and periodicity of the parameters associated with the problem. To characterize such two-dimensional information using the above theories, the decision-maker will have to consider two or more fuzzy sets or intuitionistic fuzzy sets, which may increase execution time and the amount of computation required to solve the problem. Consequently, to depict some periodic information in the judgment values, in 2002, Ramot et al. [23] proposed an important concept and called it a complex fuzzy set, where the membership function, instead of being a real-valued function with the range of [ 0 , 1 ] is replaced by a complex-valued function with codomain unit disc in the complex plane. In 2018, Yazdanbakhsh and Dick [24] made a systematic review of complex fuzzy sets and logic and highlighted several applications of complex fuzzy sets. Furthermore, to incorporate the hesitation degree and the periodicity information into the analysis, Alkouri and Salleh proposed the theory of complex intuitionistic fuzzy sets and discussed several operations of complex intuitionistic fuzzy sets [25,26]. They also defined a distance between two complex intuitionistic fuzzy sets and gave its application in a decision-making problem [27]. Subsequently, Rani and Garg gave a systematic and exhaustive investigation of complex intuitionistic fuzzy set theories [28,29,30,31,32,33,34]. In 2021, Rani and Garg [35] utilized complex intuitionistic fuzzy numbers to describe complex intuitionistic fuzzy preference relations and developed individual and group decision-making methods based on them. Meanwhile, some new types of fuzzy sets and their applications have been investigated by many researchers recently [36,37].
The complex intuitionistic fuzzy preference relation as a newly developed tool can describe the fuzzy characters of things in more detail and comprehensively and is very useful in dealing with the vagueness and uncertainty of actual decision-making problems, which include two-dimensional data. Consider that, in some real-life situations, sometimes, a decision-maker may provide incomplete judgments in a complex intuitionistic fuzzy preference relation because of time pressure, lack of knowledge, and the decision maker’s limited expertise related to the problem domain. In such cases, it would be sensible not to force the expert to express “false” preferences over these objects, and thus an incomplete complex intuitionistic fuzzy preference relation could be constructed, in which some elements are missing. As a result, how to define incomplete complex intuitionistic fuzzy preference relations and to estimate their missing information becomes a necessary step in a decision-making process. It is a necessity to develop some effective techniques for estimating missing information. Meanwhile, consider that in the practical decision-making problems, since the increasing complexity and uncertainty of the socioeconomic environment, we notice that group decision-making makes decision-making more scientific and democratic. Therefore, it is also necessary to consider group decision-making problems in which there exist multiple incomplete complex intuitionistic fuzzy preference relations. As is well known, the weights of experts reflect the influence of experts on the decision results in the group decision-making problems, which directly determine the feasibility and rationality of the decision results. So in the group decision-making process, how to scientifically determine the weights of experts is also very important. The framework proposed in this paper can describe the fuzzy characteristics of things in more detail and comprehensively. It is very useful in dealing with the vagueness and uncertainty of actual decision-making problems, which include two-dimensional data, that is, the properties and periodicity of the parameters associated with the problem. It also effectively generalizes and enriches the previous works, and has a good application prospect.
In this paper, we will pay attention to these issues. To do that, the remainder of this paper is organized as follows: In Section 2, some basic concepts related to complex fuzzy sets, complex intuitionistic fuzzy sets, and preference relations are reviewed. In Section 3, the concept of incomplete complex intuitionistic fuzzy preference relation is introduced and its properties are discussed. Meanwhile, the multiplicative consistent incomplete complex intuitionistic fuzzy preference relations are defined. Estimating algorithms are developed to estimate the missing elements in the acceptable incomplete complex intuitionistic fuzzy preference relations in Section 4. In Section 5, the expert weight determination algorithm is developed, and then the group decision-making algorithms based on incomplete complex intuitionistic fuzzy preference relations are established. In Section 6, an example is given to illuminate the solution process of the group decision-making algorithms, verify their practicality and compare and analyze their advantages and disadvantages. Meanwhile, the simulation verification of an incomplete complex intuitionistic fuzzy system is carried out by MATLAB software in this section. The conclusion is given in Section 7.

2. Preliminaries

Some basic concepts related to complex fuzzy sets, complex intuitionistic fuzzy sets, and preference relations are reviewed in this section. Table 1 summarizes the mathematical symbols and their definitions in this paper.
Definition 1
([23]). A complex fuzzy set A over an universe U , is formed by A = { x , μ A ( x ) : x U } , where the complex-valued membership function μ A ( x ) has the form
μ A ( x ) = r A ( x ) · e i ω A ( x ) i = 1 ,
where r A ( x ) and ω A ( x ) are both real-valued, and r A ( x ) [ 0 , 1 ] .
Definition 2
([25]). A complex intuitionistic fuzzy set A ˜ , defined on an universe of discourse U, is characterized by membership and non-membership functions μ A ˜ ( x ) and ν A ˜ ( x ) , respectively, that assign any element x U a complex-valued grade of both membership and non-membership in A ˜ .
By Definition 2, the values of μ A ˜ ( x ) , ν A ˜ ( x ) and their sum may receive all lying within the unit circle in the complex plane, and are on the form
μ A ˜ ( x ) = r A ˜ ( x ) · e i 2 π ( ω μ A ˜ ( x ) )
for membership function in A ˜ and
ν A ˜ ( x ) = s A ˜ ( x ) · e i 2 π ( ω ν A ˜ ( x ) )
for non-membership function in A ˜ , where i = 1 , each of r A ˜ ( x ) , s A ˜ ( x ) , ω μ A ˜ ( x ) and ω ν A ˜ ( x ) are real-valued functions and both belong to the interval [ 0 , 1 ] such that r A ˜ ( x ) + s A ˜ ( x ) [ 0 , 1 ] and ω μ A ˜ ( x ) + ω ν A ˜ ( x ) [ 0 , 1 ] .
Let CIF ( U ) be the set of all complex intuitionistic fuzzy sets on U . The complex intuitionistic fuzzy set A ˜ may be represented as the set of ordered pairs
A ˜ = { x , μ A ˜ ( x ) , ν A ˜ ( x ) : x U } ,
where μ A ˜ ( x ) : U { a | a C , | a | 1 } , ν A ˜ ( x ) : U { a | a C , | a | 1 } and | μ A ˜ ( x ) + ν A ˜ ( x ) | 1 .
If there is a single element x in U , then for notational convenience, we write complex intuitionistic fuzzy set A ˜ over U as ( ( r A ˜ , ω μ A ˜ ) , ( s A ˜ , ω ν A ˜ ) ) and call it complex intuitionistic fuzzy number. The class CE ˜ denotes the set of all complex intuitionistic fuzzy numbers in  A ˜ .
Definition 3
([28]). The score function S and an accuracy function H for a complex intuitionistic fuzzy number A ˜ 1 = ( ( r A ˜ 1 , ω μ A ˜ 1 ) , ( s A ˜ 1 , ω ν A ˜ 1 ) ) are given as
S ( A ˜ 1 ) = r A ˜ 1 s A ˜ 1 + ω μ A ˜ 1 ω ν A ˜ 1
and
H ( A ˜ 1 ) = r A ˜ 1 + s A ˜ 1 + ω μ A ˜ 1 + ω ν A ˜ 1 .
It is clear that S ( A ˜ 1 ) [ 2 , 2 ] and H ( A ˜ 1 ) [ 0 , 2 ] .
Let A ˜ 1 = ( ( r A ˜ 1 , ω μ A ˜ 1 ) , ( s A ˜ 1 , ω ν A ˜ 1 ) ) and A ˜ 2 = ( ( r A ˜ 2 , ω μ A ˜ 2 ) , ( s A ˜ 2 , ω ν A ˜ 2 ) ) be two complex intuitionistic fuzzy numbers. Based on the score function and accuracy function, an ordered relation between A ˜ 1 and A ˜ 2 states as
(1) 
If S ( A ˜ 1 ) < S ( A ˜ 2 ) , then A ˜ 1 < A ˜ 2 ;
(2) 
If S ( A ˜ 1 ) > S ( A ˜ 2 ) , then A ˜ 1 > A ˜ 2 ;
(3) 
If S ( A ˜ 1 ) = S ( A ˜ 2 ) , then
(i) 
If H ( A ˜ 1 ) = H ( A ˜ 2 ) , then A ˜ 1 = A ˜ 2 ;
(ii) 
If H ( A ˜ 1 ) < H ( A ˜ 2 ) , then A ˜ 1 < A ˜ 2 ;
(iii) 
If H ( A ˜ 1 ) > H ( A ˜ 2 ) , then A ˜ 1 > A ˜ 2 .
As is well known, the score function of a complex intuitionistic fuzzy number is determined by the difference between the amplitude term of membership degree and non-membership degree and the difference between the phase term of membership degree and non-membership degree, which is defined as the sum of these two parts. In both senses, it expresses the degree of certainty, which corresponds to a positive benefit function in some sense. However, the accuracy function expresses the degree of negation, which corresponds to a cost function in some sense. Therefore, this paper applies the score function first to rank the alternatives. Of course, when the score function values are equal, we will rank the alternatives by calculating and comparing the accuracy function values to choose the best solution.
Definition 4
([28]). Suppose A ˜ 1 = ( ( r A ˜ 1 , ω μ A ˜ 1 ) , ( s A ˜ 1 , ω ν A ˜ 1 ) ) and A ˜ 2 = ( ( r A ˜ 2 , ω μ A ˜ 2 ) , ( s A ˜ 2 , ω ν A ˜ 2 ) ) be two complex intuitionistic fuzzy numbers, then
(i) A ˜ 1 A ˜ 2 if r A ˜ 1 r A ˜ 2 , s A ˜ 1 s A ˜ 2 and ω μ A ˜ 1 ω μ A ˜ 2 , ω ν A ˜ 1 ω ν A ˜ 2 ;
(ii) A ˜ 1 = A ˜ 2 if and only if A ˜ 1 A ˜ 2 and A ˜ 2 A ˜ 1 ;
(iii) A ˜ 1 C = ( ( s A ˜ 1 , ω ν A ˜ 1 ) , ( r A ˜ 1 , ω μ A ˜ 1 ) ) .
Definition 5
([28]). Suppose A ˜ 1 = ( ( r A ˜ 1 , ω μ A ˜ 1 ) , ( s A ˜ 1 , ω ν A ˜ 1 ) ) and A ˜ 2 = ( ( r A ˜ 2 , ω μ A ˜ 2 ) , ( s A ˜ 2 , ω ν A ˜ 2 ) ) be two complex intuitionistic fuzzy numbers, and λ > 0 , then
(i) A ˜ 1 A ˜ 2 = ( ( r A ˜ 1 + r A ˜ 2 r A ˜ 1 r A ˜ 2 , ω μ A ˜ 1 + ω μ A ˜ 2 ω μ A ˜ 1 ω μ A ˜ 2 ) , ( s A ˜ 1 s A ˜ 2 , ω ν A ˜ 1 ω ν A ˜ 2 ) ) ;
(ii) A ˜ 1 A ˜ 2 = ( ( r A ˜ 1 r A ˜ 2 , ω μ A ˜ 1 ω μ A ˜ 2 ) , ( s A ˜ 1 + s A ˜ 2 s A ˜ 1 s A ˜ 2 , ω ν A ˜ 1 + ω ν A ˜ 2 ω ν A ˜ 1 ω ν A ˜ 2 ) ) ;
(iii) λ A ˜ 1 = ( ( 1 ( 1 r A ˜ 1 ) λ , 1 ( 1 ω μ A ˜ 1 ) λ ) , ( s A ˜ 1 λ , ω ν A ˜ 1 λ ) ) ;
(iv) A ˜ 1 λ = ( ( r A ˜ 1 λ , ω μ A ˜ 1 λ ) , ( 1 ( 1 s A ˜ 1 ) λ , 1 ( 1 ω ν A ˜ 1 ) λ ) ) .
Theorem 1.
Let A ˜ 1 = ( ( r A ˜ 1 , ω μ A ˜ 1 ) , ( s A ˜ 1 , ω ν A ˜ 1 ) ) and A ˜ 2 = ( ( r A ˜ 2 , ω μ A ˜ 2 ) , ( s A ˜ 2 , ω ν A ˜ 2 ) ) be two complex intuitionistic fuzzy numbers, then A ˜ 1 A ˜ 2 , A ˜ 1 A ˜ 2 , λ A ˜ 1 and A ˜ 1 λ ( λ > 0 ) are also complex intuitionistic fuzzy numbers and
(i) A ˜ 1 A ˜ 2 = A ˜ 2 A ˜ 1 ;
(ii) A ˜ 1 A ˜ 2 = A ˜ 2 A ˜ 1 ;
(iii) λ ( A ˜ 1 A ˜ 2 ) = λ A ˜ 1 λ A ˜ 2 , λ > 0 ;
(iv) ( A ˜ 1 A ˜ 2 ) λ = A ˜ 1 λ A ˜ 2 λ , λ > 0 ;
(v) λ 1 A ˜ 1 λ 2 A ˜ 1 = ( λ 1 + λ 2 ) A ˜ 1 , λ 1 , λ 2 > 0 ;
(vi) A ˜ 1 λ 1 A ˜ 1 λ 2 = A ˜ 1 λ 1 + λ 2 , λ 1 , λ 2 > 0 .
Proof. 
Obvious from Definition 5.    □
Definition 6
([15]). For a discrete set of alternatives V = { V 1 , V 2 , · · · , V n } , a preference relation R is characterized by a membership function μ R : V × V Ω , where Ω is the domain representing preference degrees.
Definition 7
([19]). An intuitionistic preference relation B on the discrete set of alternatives V = { V 1 , V 2 , · · · , V n } is represented by a matrix B = ( b i j ) n × n V × V with b i j = ( x i , x j ) , μ ( x i , x j ) , ν ( x i , x j ) for all i , j = 1 , 2 , · · · , n . For convenience, let b i j = ( μ i j , ν i j ) for all i , j = 1 , 2 , · · · , n , where b i j is an intuitionistic fuzzy number, composed by the certainty degree μ i j to which x i is preferred to x j and the certainty degree ν i j to which x i is non-preferred to x j , and π i j = 1 μ i j ν i j is interpreted as the uncertainty degree to which x i is preferred to x j . Furthermore, μ i j and ν i j satisfy the following characteristics
0 μ i j + ν i j 1 , μ j i = ν i j , ν j i = μ i j , μ i i = ν i i = 0.5 for all i , j = 1 , 2 , · · · , n .
Definition 8
([20]). An intuitionistic preference relation B = ( b i j ) n × n with b i j = ( μ i j , ν i j ) ( i , j = 1 , 2 , · · · , n ) is multiplicative consistent if for any i k j
μ i j = 0 , if ( μ i k , μ k j ) { ( 0 , 1 ) , ( 1 , 0 ) } , μ i k μ k j μ i k μ k j + ( 1 μ i k ) ( 1 μ k j ) , o t h e r w i s e ,
and
ν i j = 0 , if ( ν i k , ν k j ) { ( 0 , 1 ) , ( 1 , 0 ) } , ν i k ν k j ν i k ν k j + ( 1 ν i k ) ( 1 ν k j ) , o t h e r w i s e .
Definition 9
([19]). Let B be an intuitionistic preference relation, where b i j = ( μ i j , ν i j ) for i , j = 1 , 2 , · · · , n . Then B is called an incomplete intuitionistic preference relation, if some of its elements cannot be provided by the decision-makers, which denoted by the unknown variable “−”, and the others can be given by the decision-makers, which satisfy
0 μ i j + ν i j 1 , μ j i = ν i j , ν j i = μ i j , μ i i = ν i i = 0.5 for all i , j = 1 , 2 , · · · , n .
Definition 10
([35]). A complex intuitionistic fuzzy preference relation R on the discrete set of alternatives V = { V 1 , V 2 , · · · , V n } is represented by a matrix R = ( a ˜ i j ) n × n V × V , where a ˜ i j = ( ( r i j , ω μ i j ) , ( s i j , ω ν i j ) ) is a complex intuitionistic fuzzy number for all i , j = 1 , 2 , · · · , n . Here the amplitude and phase terms corresponding to membership degrees, that is, r i j and ω μ i j explicit the degrees to which the alternative V i is preferred over the alternative V j . On the other hand, the amplitude and phase terms corresponding to non-membership degrees, that is, s i j and ω ν i j describe the extent of non-preference of the alternative V i over the alternative V j . These terms satisfy the following characteristics
r i j , s i j , ω μ i j , ω ν i j , r i j + s i j , ω μ i j + ω ν i j [ 0 , 1 ] , r j i = s i j , s j i = r i j , ω μ j i = ω ν i j , ω ν j i = ω μ i j , r i i = s i i = ω μ i i = ω ν i i = 0.5 for all i , j = 1 , 2 , · · · , n .

3. Incomplete Complex Intuitionistic Fuzzy Preference Relations

Consider that, sometimes, a decision maker may provide incomplete judgments in a complex intuitionistic fuzzy preference relation because of time pressure, lack of knowledge, and the decision maker’s limited expertise related to the problem domain. In this section, we will investigate a novel concept of incomplete complex intuitionistic fuzzy preference relation and discuss its properties. Meanwhile, the concept of multiplicative consistent incomplete complex intuitionistic fuzzy preference relations are given.
Definition 11.
Let R = ( a ˜ i j ) n × n be a complex intuitionistic fuzzy preference relation, where a ˜ i j = ( ( r i j , ω μ i j ) , ( s i j , ω ν i j ) ) for all i , j = 1 , 2 , · · · , n . Then R is called an incomplete complex intuitionistic fuzzy preference relation if some of its elements cannot be given by the decision-makers, which we denote by “−”, and the others can be provided by the decision maker, which satisfy the following conditions
r i j , s i j , ω μ i j , ω ν i j , r i j + s i j , ω μ i j + ω ν i j [ 0 , 1 ] , r j i = s i j , s j i = r i j , ω μ j i = ω ν i j , ω ν j i = ω μ i j , r i i = s i i = ω μ i i = ω ν i i = 0.5 for all i , j = 1 , 2 , · · · , n .
Property 1.
Let R = ( a ˜ i j ) n × n be an incomplete complex intuitionistic fuzzy preference relation, where a ˜ i j = ( ( r i j , ω μ i j ) , ( s i j , ω ν i j ) ) for all i , j = 1 , 2 , · · · , n and Ω be the set of all the known elements, then
(i) Triangle condition: If a ˜ i j a ˜ i k a ˜ k j for all a ˜ i k , a ˜ k j , a ˜ i j Ω , then we say that an incomplete complex intuitionistic fuzzy preference relation R satisfies triangle condition. This condition can be explained geometrically as follows: Let the alternatives V i , V k and V j represent the triangle vertices and let the lengths of triangle sides be a ˜ i k , a ˜ k j and a ˜ i j . Then, the triangle condition states that the sum of lengths of vertices V i , V k and V k , V j should be greater than or equal to the lengths of vertices V i , V j .
(ii) Weak transitivity condition: If ( ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ) a ˜ i k , ( ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ) a ˜ k j then ( ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ) a ˜ i j for all a ˜ i k , a ˜ k j , a ˜ i j Ω , then we say that an incomplete complex intuitionistic fuzzy preference relation R satisfies weak transitivity condition. This property states that if the alternative V i is preferred to V k with preference value a ˜ i k and the alternative V k is preferred to V j with preference value a ˜ k j , then the alternative V i is preferred to V j with preference value a ˜ i j .
(iii) Max-min transitivity condition: If min { a ˜ i k , a ˜ k j } a ˜ i j for all a ˜ i k , a ˜ k j , a ˜ i j Ω , then we say that an incomplete complex intuitionistic fuzzy preference relation R satisfies max-min transitivity condition. This property can be interpreted as follows: The complex intuitionistic fuzzy value giving the preference value of alternative V i over V j should be greater than or equal to the minimum complex intuitionistic fuzzy value acquired by comparing alternatives V i and V j with an intermediate one.
(iv) Max-max transitivity condition: If max { a ˜ i k , a ˜ k j } a ˜ i j for all a ˜ i k , a ˜ k j , a ˜ i j Ω , then we say that an incomplete complex intuitionistic fuzzy preference relation R satisfies max-max transitivity condition. This property can be interpreted as follows: The complex intuitionistic fuzzy value giving the preference value of alternative V i over V j should be greater than or equal to the maximum complex intuitionistic fuzzy number value acquired by comparing alternatives V i and V j with an intermediate one.
(v) Restricted Max-min transitivity condition: If ( ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ) a ˜ i k , ( ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ) a ˜ k j min { a ˜ i k , a ˜ k j } a ˜ i j for all a ˜ i k , a ˜ k j , a ˜ i j Ω , then we say that an incomplete complex intuitionistic fuzzy preference relation R satisfies restricted max-min transitivity condition. This property can be interpreted in the following way: When the alternative V i is preferred to V k with a complex intuitionistic fuzzy value a ˜ i k , and the alternative V k is preferred to V j with a complex intuitionistic fuzzy value a ˜ k j , then V i should be preferred to V j with at least a complex intuitionistic fuzzy value a ˜ i j equal to the minimum of the above values. With equality only when there is indifference between at least two of the three alternatives.
(vi) Restricted Max-max transitivity condition: If ( ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ) a ˜ i k , ( ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ) a ˜ k j max { a ˜ i k , a ˜ k j } a ˜ i j for all a ˜ i k , a ˜ k j , a ˜ i j Ω , then we say that an incomplete complex intuitionistic fuzzy preference relation R satisfies restricted max-max transitivity condition. This property can be interpreted in the following way: When the alternative V i is preferred to V k with a complex intuitionistic fuzzy value a ˜ i k , and the alternative V k are preferred to V j with a complex intuitionistic fuzzy value a ˜ k j , then V i should be preferred to V j with at least a complex intuitionistic fuzzy value a ˜ i j equal to the maximum of the above values. With equality only when there is indifference between at least two of the three alternatives.
Definition 12.
Let R = ( a ˜ i j ) n × n be an incomplete complex intuitionistic fuzzy preference relation, then R is called a consistent incomplete complex intuitionistic fuzzy preference relation if it satisfies the multiplicative transitivity
a ˜ i j = a ˜ i k a ˜ k j for all a ˜ i j , a ˜ k j , a ˜ i k Ω ,
where Ω is the set of all the known elements.
Definition 13.
Let R = ( a ˜ i j ) n × n be an incomplete complex intuitionistic fuzzy preference relation, if ( i , j ) ( k , l ) . Then the element a ˜ i j and a ˜ k l are called adjoining. For the unknown element a ˜ i j , if there exist two adjoining known elements a ˜ i k and a ˜ k j , then a ˜ i j is called available. Indeed, the element a ˜ i j can be obtained indirectly by using Equation (5), which means that the estimated element a ˜ i j should be taken according to the known elements a ˜ i k and a ˜ k j .
Definition 14.
Let R = ( a ˜ i j ) n × n be an incomplete complex intuitionistic fuzzy preference relation if each unknown element can be derived from its adjoining known elements, then R is called acceptable; otherwise, R is called unacceptable.
Obviously, for an incomplete complex intuitionistic fuzzy preference relation R = ( a ˜ i j ) n × n , if R is acceptable, then there exists at least one known element (except diagonal elements) in each line or each column of R , i.e., there exists at least ( n 1 ) judgments provided by the decision maker (that is to say, each one of the alternatives is compared at least once).
Definition 15.
A complex intuitionistic fuzzy preference relation R = ( a ˜ i j ) n × n with a ˜ i j = ( ( r i j , ω μ i j ) , ( s i j , ω ν i j ) ) ( i , j = 1 , 2 , · · · , n ) is multiplicative consistent if for any i k j
r i j = 0 , if ( r i k , r k j ) { ( 0 , 1 ) , ( 1 , 0 ) } , r i k r k j r i k r k j + ( 1 r i k ) ( 1 r k j ) , o t h e r w i s e ,
s i j = 0 , if ( s i k , s k j ) { ( 0 , 1 ) , ( 1 , 0 ) } , s i k s k j s i k s k j + ( 1 s i k ) ( 1 s k j ) , o t h e r w i s e ,
ω μ i j = 0 , if ( ω μ i k , ω μ k j ) { ( 0 , 1 ) , ( 1 , 0 ) } , ω μ i k ω μ k j ω μ i k ω μ k j + ( 1 ω μ i k ) ( 1 ω μ k j ) , o t h e r w i s e ,
and
ω ν i j = 0 , if ( ω ν i k , ω ν k j ) { ( 0 , 1 ) , ( 1 , 0 ) } , ω ν i k ω ν k j ω ν i k ω ν k j + ( 1 ω ν i k ) ( 1 ω ν k j ) , o t h e r w i s e .
Remark 1.
Since the function f ( x ) = x x + b is a monotone increasing function with x , b > 0 , then in Equations (6)–(9), it is clear to see that r i j , s i j , ω μ i j , ω ν i j [ 0 , 1 ] and
r i j + s i j = r i k r k j r i k r k j + ( 1 r i k ) ( 1 r k j ) + s i k s k j s i k s k j + ( 1 s i k ) ( 1 s k j ) r i k r k j r i k r k j + ( 1 r i k ) ( 1 r k j ) + ( 1 r i k ) ( 1 r k j ) ( 1 r i k ) ( 1 r k j ) + ( 1 s i k ) ( 1 s k j ) r i k r k j r i k r k j + ( 1 r i k ) ( 1 r k j ) + ( 1 r i k ) ( 1 r k j ) ( 1 r i k ) ( 1 r k j ) + r i k r k j = r i k r k j + ( 1 r i k ) ( 1 r k j ) r i k r k j + ( 1 r i k ) ( 1 r k j ) = 1 ,
ω μ i j + ω ν i j = ω μ i k ω μ k j ω μ i k ω μ k j + ( 1 ω μ i k ) ( 1 ω μ k j ) + ω ν i k ω ν k j ω ν i k ω ν k j + ( 1 ω ν i k ) ( 1 ω ν k j ) ω μ i k ω μ k j ω μ i k ω μ k j + ( 1 ω μ i k ) ( 1 ω μ k j ) + ( 1 ω μ i k ) ( 1 ω μ k j ) ( 1 ω μ i k ) ( 1 ω μ k j ) + ( 1 ω ν i k ) ( 1 ω ν k j ) ω μ i k ω μ k j ω μ i k ω μ k j + ( 1 ω μ i k ) ( 1 ω μ k j ) + ( 1 ω μ i k ) ( 1 ω μ k j ) ( 1 ω μ i k ) ( 1 ω μ k j ) + ω μ i k ω μ k j = ω μ i k ω μ k j + ( 1 ω μ i k ) ( 1 ω μ k j ) ω μ i k ω μ k j + ( 1 ω μ i k ) ( 1 ω μ k j ) = 1 ,
that is r i j + s i j 1 and ω μ i j + ω ν i j 1 . In particular, we have
r i j + s i j = 1 , if r i k + s i k = 1 a n d r k j + s k j = 1 , < 1 , o t h e r w i s e ,
and
ω μ i j + ω ν i j = 1 , if ω μ i k + ω ν i k = 1 a n d ω μ k j + ω ν k j = 1 , < 1 , o t h e r w i s e .
Theorem 2.
Any complex intuitionistic preference relation R = ( a ˜ i j ) 2 × 2 is multiplicative consistent.
Proof. 
Since
r 11 r 12 r 11 r 12 + ( 1 r 11 ) ( 1 r 12 ) = 0.5 r 12 0.5 r 12 + 0.5 ( 1 r 12 ) = r 12 ,
s 11 s 12 r 11 s 12 + ( 1 s 11 ) ( 1 s 12 ) = 0.5 s 12 0.5 s 12 + 0.5 ( 1 s 12 ) = s 12 ,
ω μ 11 ω μ 12 ω μ 11 ω μ 12 + ( 1 ω μ 11 ) ( 1 ω μ 12 ) = 0.5 ω μ 12 0.5 ω μ 12 + 0.5 ) ( 1 ω μ 12 ) = ω μ 12 ,
and
ω ν 11 ω ν 12 ω ν 11 ω ν 12 + ( 1 ω ν 11 ) ( 1 ω ν 12 ) = 0.5 ω ν 12 0.5 ω ν 12 + 0.5 ) ( 1 ω ν 12 ) = ω ν 12 ,
which satisfy Equations (6)–(9). In addition, in the case where r 12 = 0 , ω μ 12 = 0 or s 12 = 0 , ω ν 12 = 0 , Equations (6)–(9) also hold.    □
Example 1.
Let R 1 , R 2 and R 3 be three complex intuitionistic fuzzy preference relations, where
R 1 = ( ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ) ( ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ) ( ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ) ( ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ) ( ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ) ( ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ) ( ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ) ( ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ) ( ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) )
R 2 = ( ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ) ( ( 0.4 , 0.2 ) , ( 0.5 , 0.5 ) ) ( ( 0.5 , 0.2 ) , ( 0.2 , 0.4 ) ) ( ( 0.5 , 0.5 ) , ( 0.4 , 0.2 ) ) ( ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ) ( ( 0.6 , 0.5 ) , ( 0.2 , 0.4 ) ) ( ( 0.2 , 0.4 ) , ( 0.5 , 0.2 ) ) ( ( 0.2 , 0.4 ) , ( 0.6 , 0.5 ) ) ( ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) )
R 3 = ( ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ) ( ( 0.6 , 0.4 ) , ( 0.3 , 0.5 ) ) ( ( 0.7 , 0.5 ) , ( 0.2 , 0.4 ) ) ( ( 0.3 , 0.5 ) , ( 0.6 , 0.4 ) ) ( ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ) ( ( 0.5 , 0.4 ) , ( 0.4 , 0.3 ) ) ( ( 0.2 , 0.4 ) , ( 0.7 , 0.5 ) ) ( ( 0.4 , 0.3 ) , ( 0.5 , 0.4 ) ) ( ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) )
It is clear to see from Equations (6)–(9) that both R 1 and R 2 are multiplicative consistent, complex intuitionistic preference relations. However, in R 3 , we have
r 13 = r 12 r 23 r 12 r 23 + ( 1 r 12 ) ( 1 r 23 ) = 0.6 × 0.5 0.6 × 0.5 + ( 1 0.6 ) ( 1 0.5 ) = 0.6 ,
s 13 = s 12 s 23 s 12 s 23 + ( 1 s 12 ) ( 1 s 23 ) = 0.3 × 0.4 0.3 × 0.4 + ( 1 0.3 ) ( 1 0.4 ) = 0.2222 ,
ω μ 13 = ω μ 12 ω μ 23 ω μ 12 ω μ 23 + ( 1 ω μ 12 ) ( 1 ω μ 23 ) = 0.4 × 0.4 0.4 × 0.4 + ( 1 0.4 ) ( 1 0.4 ) = 0.3077 ,
and
ω ν 13 = ω ν 12 ω ν 23 ω ν 12 ω ν 23 + ( 1 ω ν 12 ) ( 1 ω ν 23 ) = 0.5 × 0.3 0.5 × 0.3 + ( 1 0.5 ) ( 1 0.3 ) = 0.3 ,
obviously, ( ( 0.7 , 0.5 ) , ( 0.2 , 0.4 ) ) ( ( 0.6 , 0.3077 ) , ( 0.2222 , 0.3 ) ) . Hence, R 3 is not a multiplicative consistent, complex intuitionistic preference relation.
Definition 16.
An incomplete complex intuitionistic fuzzy preference relation R = ( a ˜ i j ) n × n with a ˜ i j = ( ( r i j , ω μ i j ) , ( s i j , ω ν i j ) ) ( i , j = 1 , 2 , · · · , n ) is multiplicative consistent if for all a ˜ i k = ( ( r i k , ω μ i k ) , ( s i k , ω ν i k ) ) , a ˜ k j = ( ( r k j , ω μ k j ) , ( s k j , ω ν k j ) ) Ω and i k j
r i j = 0 , if ( r i k , r k j ) { ( 0 , 1 ) , ( 1 , 0 ) } , r i k r k j r i k r k j + ( 1 r i k ) ( 1 r k j ) , o t h e r w i s e ,
s i j = 0 , if ( s i k , s k j ) { ( 0 , 1 ) , ( 1 , 0 ) } , s i k s k j s i k s k j + ( 1 s i k ) ( 1 s k j ) , o t h e r w i s e ,
ω μ i j = 0 , if ( ω μ i k , ω μ k j ) { ( 0 , 1 ) , ( 1 , 0 ) } , ω μ i k ω μ k j ω μ i k ω μ k j + ( 1 ω μ i k ) ( 1 ω μ k j ) , o t h e r w i s e ,
and
ω ν i j = 0 if ( ω ν i k , ω ν k j ) { ( 0 , 1 ) , ( 1 , 0 ) } ω ν i k ω ν k j ω ν i k ω ν k j + ( 1 ω ν i k ) ( 1 ω ν k j ) o t h e r w i s e .
where Ω is the set of all the known elements of R .
Example 2.
Let R 1 and R 2 be two incomplete complex intuitionistic fuzzy preference relations, where
R 1 = ( ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ) ( ( 0.4 , 0.5 ) , ( 0.5 , 0.5 ) ) ( ( 0.5 , 0.5 ) , ( 0.4 , 0.5 ) ) ( ( 0.5 , 0.5 ) , ( 0.4 , 0.5 ) ) ( ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ) ( ( 0.6 , 0.5 ) , ( 0.4 , 0.5 ) ) ( ( 0.4 , 0.5 ) , ( 0.5 , 0.5 ) ) ( ( 0.4 , 0.5 ) , ( 0.6 , 0.5 ) ) ( ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ) ( ( 0.4 , 0.5 ) , ( 0.6 , 0.5 ) ) ( ( 0.6 , 0.5 ) , ( 0.4 , 0.5 ) ) ( ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) )
R 2 = ( ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ) ( ( 0.4 , 0.5 ) , ( 0.2 , 0.5 ) ) ( ( 0.6 , 0.5 ) , ( 0.3 , 0.5 ) ) ( ( 0.2 , 0.5 ) , ( 0.4 , 0.5 ) ) ( ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ) ( ( 0.3 , 0.5 ) , ( 0.1 , 0.5 ) ) ( ( 0.2 , 0.4 ) , ( 0.8 , 0.5 ) ) ( ( 0.1 , 0.5 ) , ( 0.3 , 0.5 ) ) ( ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ) ( ( 0.6 , 0.5 ) , ( 0.4 , 0.5 ) ) ( ( 0.3 , 0.5 ) , ( 0.6 , 0.5 ) ) ( ( 0.8 , 0.5 ) , ( 0.2 , 0.4 ) ) ( ( 0.4 , 0.5 ) , ( 0.6 , 0.5 ) ) ( ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) )
and “ ” denotes the unknown element.
It is clear to see from Equations (10)–(13) that R 1 is a multiplicative consistent incomplete complex intuitionistic preference relation. However, in R 2 , we have
r 24 = r 23 r 34 r 23 r 34 + ( 1 r 23 ) ( 1 r 34 ) = 0.3 × 0.6 0.3 × 0.6 + ( 1 0.3 ) ( 1 0.6 ) = 0.3913 ,
s 24 = s 23 s 34 s 23 s 34 + ( 1 s 23 ) ( 1 s 34 ) = 0.1 × 0.4 0.1 × 0.4 + ( 1 0.1 ) ( 1 0.4 ) = 0.0690 ,
ω μ 24 = ω μ 23 ω μ 34 ω μ 23 ω μ 34 + ( 1 ω μ 23 ) ( 1 ω μ 34 ) = 0.5 × 0.5 0.5 × 0.5 + ( 1 0.5 ) ( 1 0.5 ) = 0.5 ,
and
ω ν 24 = ω ν 23 ω ν 34 ω ν 23 ω ν 34 + ( 1 ω ν 23 ) ( 1 ω ν 34 ) = 0.5 × 0.5 0.5 × 0.5 + ( 1 0.5 ) ( 1 0.5 ) = 0.5 ,
obviously, ( ( 0.2 , 0.4 ) , ( 0.8 , 0.5 ) ) ( ( 0.3913 , 0.5 ) , ( 0.0690 , 0.5 ) ) . Hence, R 2 is not a multiplicative consistent incomplete complex intuitionistic preference relation.

4. Estimation Algorithms for the Acceptable Incomplete Complex Intuitionistic Fuzzy Preference Relations

4.1. The Estimation Algorithm with the Least Judgments

In the following, we shall develop a straightforward algorithm (i.e., Algorithm 1) for estimating the missing elements of an acceptable incomplete complex intuitionistic fuzzy preference relation with the least judgments based on Definition 16 (i.e., there are only n 1 known off-diagonal elements).
Algorithm 1: The estimation algorithm with the least judgments.
Step 1 : For a decision-making problem, let V = { V 1 , V 2 , , V n } be a discrete set of alternatives. A decision-maker only compares n 1 pairs of objects, ( V i , V j ) ( i = 1 , 2 , · · · , n 1 , j = i + 1 ) , on the set V and provides his/her judgements, each of which is expressed as an complex intuitionistic fuzzy number, all the judgements are contained in an incomplete complex intuitionistic fuzzy preference relation R = ( a ˜ i j ) n × n .
Step 2 : Utilize Definition 16 to estimate all the missing elements in R using the known elements, and thus get a multiplicative consistent, complete complex intuitionistic fuzzy preference relation R ¯ of R .
Step 3 : End.
Example 3.
Consider a decision-making problem with a discrete alternatives set V = { V 1 , V 2 , V 3 , V 4 } . An expert compares three pairs of objects ( V 1 , V 2 ) , ( V 2 , V 3 ) , ( V 3 , V 4 ) and provides the preference values over these pairs of objects respectively as follows
a ˜ 12 = ( ( 0.4 , 0.2 ) , ( 0.2 , 0.4 ) ) , a ˜ 23 = ( ( 0.6 , 0.4 ) , ( 0.3 , 0.5 ) ) , a ˜ 34 = ( ( 0.8 , 0.5 ) , ( 0.1 , 0.5 ) ) .
Thus, by Definition 11, we can construct an incomplete complex intuitionistic fuzzy preference relation as follows
R = ( ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ) ( ( 0.4 , 0.2 ) , ( 0.2 , 0.4 ) ) ( ( 0.2 , 0.4 ) , ( 0.4 , 0.2 ) ) ( ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ) ( ( 0.6 , 0.4 ) , ( 0.3 , 0.5 ) ) ( ( 0.3 , 0.5 ) , ( 0.6 , 0.4 ) ) ( ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ) ( ( 0.8 , 0.5 ) , ( 0.1 , 0.5 ) ) ( ( 0.1 , 0.5 ) , ( 0.8 , 0.5 ) ) ( ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) )
where “ ” denotes the unknown element.
Based on the known elements in R , we can utilize Equations (10)–(13) to estimate all the missing elements as follows
r 13 = r 12 r 23 r 12 r 23 + ( 1 r 12 ) ( 1 r 23 ) = 0.4 × 0.6 0.4 × 0.6 + ( 1 0.4 ) ( 1 0.6 ) = 0.5 ,
s 13 = s 12 s 23 s 12 s 23 + ( 1 s 12 ) ( 1 s 23 ) = 0.2 × 0.3 0.2 × 0.3 + ( 1 0.2 ) ( 1 0.3 ) = 0.0968 ,
ω μ 13 = ω μ 12 ω μ 23 ω μ 12 ω μ 23 + ( 1 ω μ 12 ) ( 1 ω μ 23 ) = 0.2 × 0.4 0.2 × 0.4 + ( 1 0.2 ) ( 1 0.4 ) = 0.1429 ,
and
ω ν 13 = ω ν 12 ω ν 23 ω ν 12 ω ν 23 + ( 1 ω ν 12 ) ( 1 ω ν 23 ) = 0.4 × 0.5 0.4 × 0.5 + ( 1 0.4 ) ( 1 0.5 ) = 0.4 .
That is,
a ˜ 13 = ( ( r 13 , ω μ 13 ) , ( s 13 , ω ν 13 ) ) = ( ( 0.5 , 0.1429 ) , ( 0.0968 , 0.4 ) ) ,
and
a ˜ 31 = ( ( r 31 , ω μ 31 ) , ( s 31 , ω ν 31 ) ) = ( ( 0.0968 , 0.4 ) , ( 0.5 , 0.1429 ) ) .
In a similar way, we can obtain the other missing elements as follows
a ˜ 14 = ( ( 0.8 , 0.1429 ) , ( 0.0118 , 0.4 ) ) , a ˜ 41 = ( ( 0.0118 , 0.4 ) , ( 0.8 , 0.1429 ) ) ,
and
a ˜ 24 = ( ( 0.8571 , 0.5 ) , ( 0.0455 , 0.5 ) ) , a ˜ 42 = ( ( 0.0455 , 0.5 ) , ( 0.8571 , 0.5 ) ) .
Based on all these elements, we can construct a multiplicative consistent, complete complex intuitionistic fuzzy preference relation as follows
R ¯ = ( ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ) ( ( 0.4 , 0.5 ) , ( 0.2 , 0.5 ) ) ( ( 0.5 , 0.1429 ) , ( 0.0968 , 0.4 ) ) ) ( ( 0.8 , 0.1429 ) , ( 0.0118 , 0.4 ) ) ( ( 0.2 , 0.5 ) , ( 0.4 , 0.5 ) ) ( ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ) ( ( 0.6 , 0.5 ) , ( 0.3 , 0.5 ) ) ( ( 0.8571 , 0.5 ) , ( 0.0455 , 0.5 ) ) ( ( 0.0968 , 0.4 ) , ( 0.5 , 0.1429 ) ) ( ( 0.3 , 0.5 ) , ( 0.6 , 0.5 ) ) ( ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ) ( ( 0.8 , 0.5 ) , ( 0.1 , 0.5 ) ) ( ( 0.0118 , 0.4 ) , ( 0.8 , 0.1429 ) ) ( ( 0.0455 , 0.5 ) , ( 0.8571 , 0.5 ) ) ( ( 0.1 , 0.5 ) , ( 0.8 , 0.5 ) ) ( ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) )

4.2. The Estimation Algorithm with More Known Judgments

Now we consider an acceptable incomplete complex intuitionistic fuzzy preference relation R = ( a ˜ i j ) n × n in a more general form, that is, there may exist other known elements in R . In this case, for all a ˜ i k = ( ( r i k , ω μ i k ) , ( s i k , ω ν i k ) ) , a ˜ k j = ( ( r k j , ω μ k j ) , ( s k j , ω ν k j ) ) Ω and i , k , j = 1 , 2 , · · · , n , where Ω is the set of all the known elements in R , each missing element a ˜ i j in R = ( a ˜ i j ) n × n can be estimated as a ˜ ¯ i j = ( ( r ¯ i j , ω ¯ μ i j ) , ( s ¯ i j , ω ¯ ν i j ) ) .
Let R = ( a ˜ i j ) n × n be an acceptable incomplete complex intuitionistic fuzzy preference relation, then, based on Equation (5), each unknown element a ˜ i j can be estimated indirectly by using
a ˜ ¯ i j = ( k Z i j ( a ˜ i k a ˜ k j ) ) 1 z i j
where Z i j = { k | a ˜ i k , a ˜ k j Ω } , z i j is the number of the elements in Z i j . Then we construct a complete complex intuitionistic fuzzy preference relation R ¯ = ( a ˜ ¯ i j ) n × n , where
a ˜ ¯ i j = a ˜ i j , if a ˜ i j Ω , a ˜ ¯ i j , if a ˜ i j Ω .
Clearly, an unknown element a ˜ i j can be estimated if there exists at least one k so that the element a ˜ i k and a ˜ k j are known. The complete complex intuitionistic fuzzy preference relation R ¯ contains both the direct complex intuitionistic fuzzy preference information given by the decision maker and the indirect complex intuitionistic preference information derived from the known complex intuitionistic preference information. The estimation algorithm with more known judgments is shown in Algorithm 2.   
Algorithm 2: The estimation algorithm with more known judgments (I).
Step 1 : For a decision-making problem, let V = { V 1 , V 2 , , V n } be a discrete set of alternatives. A decision-maker provides their complex intuitionistic fuzzy preference number for each pair of alternatives and constructs an acceptable incomplete complex intuitionistic fuzzy preference relation R = ( a ˜ i j ) n × n .
Step 2 : Utilize Equation (15) to construct the complete complex intuitionistic fuzzy preference relation R ¯ = ( a ˜ ¯ i j ) n × n of R = ( a ˜ i j ) n × n .
Step 3 : End.
Example 4.
Consider a decision making problem with a discrete alternatives set V = { V 1 , V 2 , V 3 } , an expert provides his/her complex intuitionistic fuzzy preference value for each pair of alternatives, and constructs an acceptable incomplete complex intuitionistic fuzzy preference relation R = ( a ˜ i j ) 3 × 3 as follows
R = ( ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ) ( ( 0.7 , 0.5 ) , ( 0.2 , 0.4 ) ) ( ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ) ( ( 0.5 , 0.4 ) , ( 0.4 , 0.3 ) ) ( ( 0.2 , 0.4 ) , ( 0.7 , 0.5 ) ) ( ( 0.4 , 0.3 ) , ( 0.5 , 0.4 ) ) ( ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) )
where “ ” denotes the unknown element.
Utilize Equation (15) to construct the complete complex intuitionistic fuzzy preference relation R ¯ = ( a ˜ ¯ i j ) 3 × 3 of R = ( a ˜ i j ) 3 × 3
R ¯ = ( ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ) ( ( 0.28 , 0.15 ) , ( 0.69 , 0.64 ) ) ( ( 0.7 , 0.5 ) , ( 0.2 , 0.4 ) ) ( ( 0.69 , 0.64 ) , ( 0.28 , 0.15 ) ) ( ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ) ( ( 0.5 , 0.4 ) , ( 0.4 , 0.3 ) ) ( ( 0.2 , 0.4 ) , ( 0.7 , 0.5 ) ) ( ( 0.4 , 0.3 ) , ( 0.5 , 0.4 ) ) ( ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) )
Next, we still consider an acceptable incomplete complex intuitionistic fuzzy preference relation R = ( a ˜ i j ) n × n in a more general form as above. Then we shall provide another algorithm (i.e., Algorithm 3) to estimate the missing elements a ˜ i j in R = ( a ˜ i j ) n × n . For all a ˜ i k = ( ( r i k , ω μ i k ) , ( s i k , ω ν i k ) ) , a ˜ k j = ( ( r k j , ω μ k j ) , ( s k j , ω ν k j ) ) Ω and i k j , where Ω is the set of all the known elements in R , then each missing element a ˜ i j in R = ( a ˜ i j ) n × n can be estimated as a ˜ ¯ i j = ( ( r ¯ i j , ω ¯ μ i j ) , ( s ¯ i j , ω ¯ ν i j ) ) , where
r ¯ i j = 1 z i j k Z i j r i k r k j r i k r k j + ( 1 r i k ) ( 1 r k j ) ,
s ¯ i j = 1 z i j k Z i j s i k s k j s i k s k j + ( 1 s i k ) ( 1 s k j ) ,
ω ¯ μ i j = 1 z i j k Z i j ω μ i k ω μ k j ω μ i k ω μ k j + ( 1 ω μ i k ) ( 1 ω μ k j ) ,
and
ω ¯ ν i j = 1 z i j k Z i j ω ν i k ω ν k j ω ν i k ω ν k j + ( 1 ω ν i k ) ( 1 ω ν k j ) ,
where Z i j = { k | a ˜ i k , a ˜ k j Ω } , z i j is the number of the elements in Z i j . Then we get a complete complex intuitionistic fuzzy preference relation R ¯ = ( a ˜ ¯ i j ) n × n , where
a ˜ ¯ i j = a ˜ i j , if a ˜ i j Ω , a ˜ ¯ i j , if a ˜ i j Ω .
Algorithm 3: The estimation algorithm with more known judgments (II).
Step 1 : It is similar to Step 1 of Algorithm 2.
Step 2 : Utilize Equation (16) to construct the complete complex intuitionistic fuzzy preference relation R ¯ = ( a ˜ ¯ i j ) n × n of R = ( a ˜ i j ) n × n .
Step 3 : End.
Example 5.
Consider an incomplete complex intuitionistic fuzzy preference relation
R = ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ( 0.4 , 0.3 ) , ( 0.2 , 0.4 ) ( 0.6 , 0.5 ) , ( 0.3 , 0.1 ) ( 0.6 , 0.3 ) , ( 0.1 , 0.5 ) ( 0.2 , 0.4 ) , ( 0.4 , 0.3 ) ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ( 0.3 , 0.5 ) , ( 0.1 , 0.5 ) ( 0.2 , 0.3 ) , ( 0.8 , 0.1 ) ( 0.3 , 0.1 ) , ( 0.6 , 0.5 ) ( 0.1 , 0.5 ) , ( 0.3 , 0.5 ) ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ( 0.6 , 0.3 ) , ( 0.4 , 0.7 ) ( 0.7 , 0.2 ) , ( 0.2 , 0.5 ) ( 0.8 , 0.1 ) , ( 0.2 , 0.3 ) ( 0.4 , 0.7 ) , ( 0.6 , 0.3 ) ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ( 0.6 , 0.4 ) , ( 0.2 , 0.5 ) ( 0.1 , 0.5 ) , ( 0.6 , 0.3 ) ( 0.2 , 0.5 ) , ( 0.7 , 0.2 ) ( 0.2 , 0.5 ) , ( 0.6 , 0.4 ) ( 0.5 , 0.5 ) , ( 0.5 , 0.5 )
where “ ” denotes the unknown element.
Based on the known elements in R , we can utilize Equation (16) to estimate all the missing elements and construct a complete complex intuitionistic fuzzy preference relation as follows
R ¯ = ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ( 0.4 , 0.3 ) , ( 0.2 , 0.4 ) ( 0.6 , 0.5 ) , ( 0.3 , 0.1 ) ( 0.4176 , 0.2276 ) , ( 0.3611 , 0.1374 ) ( 0.6 , 0.3 ) , ( 0.1 , 0.5 ) ( 0.2 , 0.4 ) , ( 0.4 , 0.3 ) ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ( 0.3 , 0.5 ) , ( 0.1 , 0.5 ) ( 0.2 , 0.3 ) , ( 0.8 , 0.1 ) ( 0.3864 , 0.2111 ) , ( 0.2635 , 0.3 ) ( 0.3 , 0.1 ) , ( 0.6 , 0.5 ) ( 0.1 , 0.5 ) , ( 0.3 , 0.5 ) ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ( 0.6 , 0.3 ) , ( 0.4 , 0.7 ) ( 0.7 , 0.2 ) , ( 0.2 , 0.5 ) ( 0.3611 , 0.1374 ) , ( 0.4176 , 0.2276 ) ( 0.8 , 0.1 ) , ( 0.2 , 0.3 ) ( 0.4 , 0.7 ) , ( 0.6 , 0.3 ) ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ( 0.6 , 0.4 ) , ( 0.2 , 0.5 ) ( 0.1 , 0.5 ) , ( 0.6 , 0.3 ) ( 0.2635 , 0.3 ) , ( 0.3864 , 0.2111 ) ( 0.2 , 0.5 ) , ( 0.7 , 0.2 ) ( 0.2 , 0.5 ) , ( 0.6 , 0.4 ) ( 0.5 , 0.5 ) , ( 0.5 , 0.5 )

5. Group Decision-Making Algorithms Based on Incomplete Complex Intuitionistic Fuzzy Preference Relations

Consider that in the practical decision-making problems, since the increasing complexity and uncertainty of the socioeconomic environment, we notice that group decision-making makes decision-making more scientific and democratic. Therefore, it is necessary to consider group decision-making problems in which there exist multiple incomplete complex intuitionistic fuzzy preference relations. As is well known, the weight of experts reflects the influence of experts on the decision results in the group decision-making problems, which directly determines the feasibility and rationality of the decision results.
Based on the analysis above, in this section, we will first develop an expert weight determination algorithm for the group decision-making problems, and then develop group decision-making algorithms based on incomplete complex intuitionistic fuzzy preference relations.
First of all, the expert weight determination algorithm is developed and shown in Algorithm 4.   
Algorithm 4: The expert weight determination algorithm.
Step 1 : Utilize Equation (1) to calculate scoring matrix S ( k ) = ( S ( a ˜ i j ( k ) ) ) n × n of R ( k ) = ( a ˜ i j ( k ) ) n × n ( k = 1 , 2 , , m ) .
Step 2 : Utilize the mean of the score function values b i j = 1 m k = 1 m S ( a ˜ i j ( k ) ) ( i , j = 1 , 2 , , n ) to construct the mean scoring matrix S ¯ = ( b i j ) n × n of the scoring matrix S ( k ) = ( S ( a ˜ i j ( k ) ) ) n × n .
Step 3 : Utilize the mean deviation analysis formula A k = 1 n 2 i = 1 n j = 1 n S ( a ˜ i j ( k ) ) b i j to calculate the weight of the decision-maker, where w k = 1 A k k = 1 m ( 1 A k ) , k = 1 , 2 , · · · , m , i , j = 1 , 2 , · · · , n , w k 0 and k = 1 m w k = 1 .
Consider a group decision-making problem, let V = { V 1 , V 2 , · · · , V n } be a discrete set of alternatives and D = { d 1 , d 2 , · · · , d m } be the set of decision-makers. The decision-maker d k D provides his/her complex intuitionistic fuzzy preference value for each pair of alternatives and constructs a complex intuitionistic fuzzy preference relation R ( k ) = ( a ˜ i j ( k ) ) n × n , where i , j = 1 , 2 , , n , k = 1 , 2 , , m . Note that if R ( k ) is an acceptable complete complex intuitionistic fuzzy preference relation, then go to the algorithm. However, if R ( k ) is an acceptable incomplete complex intuitionistic fuzzy preference relation, then we can utilize Algorithms 1–3 proposed above to construct a new acceptable complete complex intuitionistic fuzzy preference relation.
Example 6 is used to illustrate the expert weight determination algorithm.
Example 6.
Suppose that a committee of three experts D = { d 1 , d 2 , d 3 } is set up to assess the alternatives V = { V 1 , V 2 , V 3 } . Each expert d k conduct pairwise comparisons among alternatives and gave their judgement values in an acceptable complete complex intuitionistic fuzzy preference relation R ( k ) = ( a ˜ i j ( k ) ) 3 × 3 , where a ˜ i j ( k ) = ( ( r i j ( k ) , ω μ i j ( k ) ) , ( s i j ( k ) , ω ν i j ( k ) ) ) expresses the preference degree of alternative V i over V j for each i , j = 1 , 2 , 3 and k = 1 , 2 , 3 .
R 1 = ( ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ) ( ( 0.4 , 0.3 ) , ( 0.5 , 0.5 ) ) ( ( 0.8 , 0.6 ) , ( 0.1 , 0.3 ) ) ( ( 0.5 , 0.5 ) , ( 0.4 , 0.3 ) ) ( ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ) ( ( 0.4 , 0.3 ) , ( 0.5 , 0.6 ) ) ( ( 0.1 , 0.3 ) , ( 0.8 , 0.6 ) ) ( ( 0.5 , 0.6 ) , ( 0.4 , 0.3 ) ) ( ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) )
R 2 = ( ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ) ( ( 0.4 , 0.2 ) , ( 0.5 , 0.5 ) ) ( ( 0.5 , 0.2 ) , ( 0.2 , 0.4 ) ) ( ( 0.5 , 0.5 ) , ( 0.4 , 0.2 ) ) ( ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ) ( ( 0.6 , 0.5 ) , ( 0.2 , 0.4 ) ) ( ( 0.2 , 0.4 ) , ( 0.5 , 0.2 ) ) ( ( 0.2 , 0.4 ) , ( 0.6 , 0.5 ) ) ( ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) )
R 3 = ( ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ) ( ( 0.6 , 0.4 ) , ( 0.3 , 0.5 ) ) ( ( 0.7 , 0.5 ) , ( 0.2 , 0.4 ) ) ( ( 0.3 , 0.5 ) , ( 0.6 , 0.4 ) ) ( ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ) ( ( 0.5 , 0.4 ) , ( 0.4 , 0.3 ) ) ( ( 0.2 , 0.4 ) , ( 0.7 , 0.5 ) ) ( ( 0.4 , 0.3 ) , ( 0.5 , 0.4 ) ) ( ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) )
Step 1:Utilize Equation (1) to calculate scoring matrix S ( k ) = ( S ( a ˜ i j ( k ) ) ) 3 × 3 of R ( k ) = ( a ˜ i j ( k ) ) 3 × 3 ( k = 1 , 2 , 3 ) as follows
S ( 1 ) = 0 0.3 1 0.3 0 0.4 1 0.4 0
S ( 2 ) = 0 0.4 0.1 0.4 0 0.5 0.1 0.5 0
S ( 3 ) = 0 0.2 0.6 0.2 0 0.2 0.6 0.2 0
Step 2:Utilize the mean of the score function values b i j = 1 3 k = 1 3 S ( a ˜ i j ( k ) ) ( i , j = 1 , 2 , 3 ) to construct the mean scoring matrix S ¯ = ( b i j ) 3 × 3 of the scoring matrix S ( k ) = ( S ( a ˜ i j ( k ) ) ) 3 × 3 as follows
S ¯ = 0 0.17 0.57 0.17 0 0.1 0.57 0.1 0
Step 3:Utilize the mean deviation analysis formula A k = 1 3 2 i = 1 3 j = 1 3 S ( a ˜ i j ( k ) ) b i j to calculate the weight of the decision-maker as follows
w = ( 0.3986 , 0.4134 , 0.1880 ) T ,
where w k = 1 A k k = 1 3 ( 1 A k ) , k = 1 , 2 , 3 , i , j = 1 , 2 , 3 , w k 0 and k = 1 3 w k = 1 .
Finally, we will develop two group decision-making algorithms based on incomplete complex intuitionistic fuzzy preference relations, which are shown in Algorithms 5 and 6.   
Algorithm 5: Group decision-making algorithms based on incomplete complex intuitionistic fuzzy preference relations (I).
Step 1 :  Utilize Algorithm 2 to construct the complete complex intuitionistic fuzzy preference relation R ¯ ( k ) = ( a ˜ ¯ i j ( k ) ) n × n of R ( k ) = ( a ˜ i j ( k ) ) n × n ( k = 1 , 2 , , m ) .
Step 2 : Utilize the complex intuitionistic fuzzy arithmetic averaging operator b ˜ i ( k ) = 1 n j = 1 n a ˜ ¯ i j ( k ) , i = 1 , 2 , · · · , n to aggregate all a ˜ ¯ i j ( k ) ( j = 1 , 2 , , n ) corresponding to the alternative V i , and then get the averaged complex intuitionistic fuzzy value b ˜ i ( k ) of the alternative V i over all the other alternatives.
Step 3 : Calculate the weight vector w = ( w 1 , w 2 , · · · , w m ) T of decision-makers using Algorithm 4.
Step 4 : Utilize the complex intuitionistic fuzzy weighted arithmetic averaging operator b ˜ i = k = 1 m w k b ˜ i ( k ) ( i = 1 , 2 , , n ) to aggregate all b ˜ i ( k ) ( k = 1 , 2 , , m ) corresponding to m decision-makers into a collective complex intuitionistic fuzzy value b ˜ i of the alternative V i over all the other alternatives.
Step 5 : Rank all the b ˜ i ( i = 1 , 2 , , n ) by means of the score Function (1) and the accuracy Function (2), and then rank all the alternatives V i ( i = 1 , 2 , , n ) and select the best one in accordance with the values of b ˜ i .
Consider a group decision-making problem, let V = { V 1 , V 2 , · · · , V n } be a discrete set of alternatives and D = { d 1 , d 2 , · · · , d m } be the set of decision-makers. The decision-maker d k D provides his/her complex intuitionistic fuzzy preference value for each pair of alternatives, and constructs an incomplete complex intuitionistic fuzzy preference relation R ( k ) = ( a ˜ i j ( k ) ) n × n , where a ˜ i j ( k ) = ( ( r i j ( k ) , ω μ i j ( k ) ) , ( s i j ( k ) , ω ν i j ( k ) ) ) , r i j ( k ) , s i j ( k ) , ω μ i j ( k ) , ω ν i j ( k ) , r i j ( k ) + s i j ( k ) , ω μ i j ( k ) + ω ν i j ( k ) [ 0 , 1 ] , r j i ( k ) = s i j ( k ) , s j i ( k ) = r i j ( k ) , ω μ j i ( k ) = ω ν i j ( k ) , ω ν j i ( k ) = ω μ i j ( k ) , r i i ( k ) = s i i ( k ) = ω μ i i ( k ) = ω ν i i ( k ) = 0.5 for all i , j = 1 , 2 , · · · , n and a ˜ i j ( k ) Ω . If R ( k ) is an acceptable incomplete complex intuitionistic fuzzy preference relation, then go to the algorithm. However, if R ( k ) is an unacceptable incomplete complex intuitionistic fuzzy preference relation (this kind of situation is not very common in real problems), then the decision-maker needs to construct a new incomplete complex intuitionistic fuzzy preference relation, and follow this procedure until it is acceptable.
Algorithm 6: Group decision-making algorithms based on incomplete complex intuitionistic fuzzy preference relations (II).
Step 1 : Utilize Algorithm 3 to construct the complete complex intuitionistic fuzzy preference relation R ¯ ( k ) = ( a ˜ ¯ i j ( k ) ) n × n of R ( k ) = ( a ˜ i j ( k ) ) n × n ( k = 1 , 2 , , m ) .
Step 2 : Calculate the weight vector w = ( w 1 , w 2 , · · · , w m ) T of decision-makers using Algorithm 4.
Step 3 : Utilize the complex intuitionistic fuzzy weighted averaging operator to aggregate all individual complete complex intuitionistic fuzzy preference relations R ¯ ( k ) ( k = 1 , 2 , , m ) together with the experts’ weights w k ( k = 1 , 2 , , m ) into the collective complete complex intuitionistic fuzzy preference relation R = ( a ˜ i j ) n × n with a ˜ i j = ( ( r i j , ω μ i j ) , ( s i j , ω ν i j ) ) , where r i j = k = 1 m w k r ¯ i j ( k ) , ω μ i j = k = 1 m w k ω ¯ μ i j ( k ) , s i j = k = 1 m w k s ¯ i j ( k ) , ω ν i j = k = 1 m w k ω ¯ ν i j ( k ) , i , j = 1 , 2 , · · · , n .
Step 4 : Utilize the complex intuitionistic fuzzy averaging operator r i = 1 n j = 1 n r i j , ω μ i = 1 n j = 1 n ω μ i j , s i = 1 n j = 1 n s i j , ω ν i = 1 n j = 1 n ω ν i j to aggregate all a ˜ i j corresponding to m decision-makers into a collective complex intuitionistic fuzzy value b ˜ i = ( ( r i , ω μ i ) , ( s i , ω ν i ) ) of the alternative V i over all the other alternatives.
Step 5 :  Rank all the b ˜ i ( i = 1 , 2 , , n ) by means of the score Function (1) and the accuracy Function (2), and then rank all the alternatives V i ( i = 1 , 2 , , n ) and select the best one in accordance with the values of b ˜ i .
Remark 2.
In an incomplete complex intuitionistic fuzzy preference relation R , when the phase terms of membership and non-membership of element a ˜ i j are equal to zero (i.e., ω μ i j = 0 and ω ν i j = 0 ), that is, the periodic change of uncertain information is not considered, then the incomplete complex intuitionistic fuzzy preference relation effectively reduces to an incomplete intuitionistic preference relation. Meanwhile, the framework proposed in this paper is consistent with the conclusion of the classical incomplete intuitionistic preference relation [19]. Therefore, it has more obvious advantages than the classical intuitionistic fuzzy evaluation when considering the periodic conditions of uncertain information change.
Remark 3.
Since the complex intuitionistic fuzzy number is composed of four quantities, i.e., amplitude terms and phase terms of both membership degree and non-membership degree. Therefore, the algorithms proposed in this paper have a large amount of computation. We mainly use MATLAB software for numerical calculation.

6. Illustrative Example

In this section, we will utilize a practical example to illustrate the solution processes of the group decision-making algorithms based on incomplete complex intuitionistic fuzzy preference relation, verify their practicality, compare and analyse the advantages and disadvantages of two group decision-making algorithms. Finally, the simulation verification of complex intuitionistic fuzzy system proposed in this paper is carried out by MATLAB software.
Example 7.
Since 2019, the COVID-19 pandemic has been raging. In response to the call of the Ministry of Education to “suspend classes and continue learning”, the online teaching models have rapidly spread due to its advantages such as distance teaching and abundant teaching resources. An online teaching experience consists of computer-assisted teaching media, various computer tools and software. Therefore, there is an intense need to choose the online teaching platform carefully by keeping in view the various factors, such as cost, media characteristics, ease of use, flexibility, and so forth.
Consider that an educational institute is interested in ranking five online teaching platform, namely, V 1 : Cisco Webex, V 2 : Zoom, V 3 : Google classroom, V 4 : Tencent conference and V 5 : Coursera.
Suppose that a committee of four experts D = { d 1 , d 2 , d 3 , d 4 } is set up to assess these alternatives V = { V 1 , V 2 , V 3 , V 4 , V 5 } . On the basis of their influence on student’s academic achievement and the time taken by them for this influence, each expert d k conduct pairwise comparisons among alternatives and gave their judgement values in an acceptable incomplete complex intuitionistic fuzzy preference relation R ( k ) = ( a ˜ i j ( k ) ) 5 × 5 , where a ˜ i j ( k ) = ( ( r i j ( k ) , ω μ i j ( k ) ) , ( s i j ( k ) , ω ν i j ( k ) ) ) expresses the preference degree of alternative V i over V j for each i , j = 1 , 2 , 3 , 4 , 5 and k = 1 , 2 , 3 , 4 .
The acceptable incomplete complex intuitionistic fuzzy preference relation R ( k ) = ( a ˜ i j ( k ) ) 5 × 5 ( k = 1 , 2 , 3 , 4 ) are given by decision-makers as follows
R ( 1 ) = ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ( 0.3 , 0.3 ) , ( 0.6 , 0.4 ) ( 0.4 , 0.5 ) , ( 0.5 , 0.1 ) ( 0.7 , 0.3 ) , ( 0.3 , 0.5 ) ( 0.6 , 0.4 ) , ( 0.3 , 0.3 ) ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ( 0.2 , 0.5 ) , ( 0.4 , 0.5 ) ( 0.6 , 0.3 ) , ( 0.1 , 0.1 ) ( 0.5 , 0.1 ) , ( 0.4 , 0.5 ) ( 0.4 , 0.5 ) , ( 0.2 , 0.5 ) ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ( 0.7 , 0.3 ) , ( 0.2 , 0.7 ) ( 0.5 , 0.2 ) , ( 0.2 , 0.5 ) ( 0.1 , 0.1 ) , ( 0.6 , 0.3 ) ( 0.2 , 0.7 ) , ( 0.7 , 0.3 ) ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ( 0.8 , 0.4 ) , ( 0.1 , 0.5 ) ( 0.3 , 0.5 ) , ( 0.7 , 0.3 ) ( 0.2 , 0.5 ) , ( 0.5 , 0.2 ) ( 0.1 , 0.5 ) , ( 0.8 , 0.4 ) ( 0.5 , 0.5 ) , ( 0.5 , 0.5 )
R ( 2 ) = ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ( 0.3 , 0.3 ) , ( 0.5 , 0.4 ) ( 0.5 , 0.5 ) , ( 0.4 , 0.1 ) ( 0.8 , 0.3 ) , ( 0.1 , 0.5 ) ( 0.5 , 0.4 ) , ( 0.3 , 0.3 ) ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ( 0.7 , 0.5 ) , ( 0.2 , 0.5 ) ( 0.6 , 0.3 ) , ( 0.2 , 0.1 ) ( 0.4 , 0.1 ) , ( 0.5 , 0.5 ) ( 0.2 , 0.5 ) , ( 0.7 , 0.5 ) ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ( 0.8 , 0.3 ) , ( 0.2 , 0.7 ) ( 0.8 , 0.2 ) , ( 0.1 , 0.5 ) ( 0.1 , 0.5 ) , ( 0.8 , 0.3 ) ( 0.2 , 0.7 ) , ( 0.8 , 0.3 ) ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ( 0.3 , 0.4 ) , ( 0.4 , 0.5 ) ( 0.2 , 0.1 ) , ( 0.6 , 0.3 ) ( 0.1 , 0.5 ) , ( 0.8 , 0.2 ) ( 0.4 , 0.5 ) , ( 0.3 , 0.4 ) ( 0.5 , 0.5 ) , ( 0.5 , 0.5 )
R ( 3 ) = ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ( 0.3 , 0.3 ) , ( 0.5 , 0.4 ) ( 0.4 , 0.5 ) , ( 0.4 , 0.1 ) ( 0.8 , 0.3 ) , ( 0.1 , 0.5 ) ( 0.5 , 0.4 ) , ( 0.3 , 0.3 ) ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ( 0.2 , 0.5 ) , ( 0.4 , 0.5 ) ( 0.9 , 0.3 ) , ( 0.1 , 0.1 ) ( 0.4 , 0.5 ) , ( 0.2 , 0.5 ) ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ( 0.6 , 0.3 ) , ( 0.3 , 0.7 ) ( 0.7 , 0.2 ) , ( 0.3 , 0.5 ) ( 0.4 , 0.1 ) , ( 0.4 , 0.5 ) ( 0.1 , 0.1 ) , ( 0.9 , 0.3 ) ( 0.3 , 0.7 ) , ( 0.6 , 0.3 ) ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ( 0.9 , 0.4 ) , ( 0.1 , 0.5 ) ( 0.1 , 0.5 ) , ( 0.8 , 0.3 ) ( 0.3 , 0.5 ) , ( 0.7 , 0.2 ) ( 0.1 , 0.5 ) , ( 0.9 , 0.4 ) ( 0.5 , 0.5 ) , ( 0.5 , 0.5 )
R ( 4 ) = ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ( 0.4 , 0.3 ) , ( 0.6 , 0.4 ) ( 0.6 , 0.4 ) , ( 0.4 , 0.3 ) ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ( 0.2 , 0.5 ) , ( 0.4 , 0.5 ) ( 0.4 , 0.5 ) , ( 0.2 , 0.5 ) ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ( 0.6 , 0.3 ) , ( 0.2 , 0.7 ) ( 0.2 , 0.7 ) , ( 0.6 , 0.3 ) ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ( 0.9 , 0.4 ) , ( 0.1 , 0.5 ) ( 0.1 , 0.5 ) , ( 0.9 , 0.4 ) ( 0.5 , 0.5 ) , ( 0.5 , 0.5 )
where “ ” denotes the unknown variable.
Firstly, we use Algorithm 5 to prioritize the online course platform, which involves the following steps.
Step 1. Utilize Algorithm 2 to construct the complete complex intuitionistic fuzzy preference relations R ¯ ( k ) = ( a ˜ ¯ i j ( k ) ) 5 × 5 of R ( k ) = ( a ˜ i j ( k ) ) 5 × 5 ( k = 1 , 2 , 3 , 4 ) as follows
R ¯ ( 1 ) = ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ( 0.3 , 0.3 ) , ( 0.6 , 0.4 ) ( 0.4 , 0.5 ) , ( 0.5 , 0.1 ) ( 0.1518 , 0.1260 ) , ( 0.7277 , 0.6478 ) ( 0.7 , 0.3 ) , ( 0.3 , 0.5 ) ( 0.6 , 0.4 ) , ( 0.3 , 0.3 ) ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ( 0.2 , 0.5 ) , ( 0.4 , 0.5 ) ( 0.6 , 0.3 ) , ( 0.1 , 0.1 ) ( 0.2723 , 0.1119 ) , ( 0.4246 , 0.6597 ) ( 0.5 , 0.1 ) , ( 0.4 , 0.5 ) ( 0.4 , 0.5 ) , ( 0.2 , 0.5 ) ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ( 0.7 , 0.3 ) , ( 0.2 , 0.7 ) ( 0.5 , 0.2 ) , ( 0.2 , 0.5 ) ( 0.7277 , 0.6478 ) , ( 0.1518 , 0.1260 ) ( 0.1 , 0.1 ) , ( 0.6 , 0.3 ) ( 0.2 , 0.7 ) , ( 0.7 , 0.3 ) ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ( 0.8 , 0.4 ) , ( 0.1 , 0.5 ) ( 0.3 , 0.5 ) , ( 0.7 , 0.3 ) ( 0.4246 , 0.6597 ) , ( 0.2723 , 0.1119 ) ( 0.2 , 0.5 ) , ( 0.5 , 0.2 ) ( 0.1 , 0.5 ) , ( 0.8 , 0.4 ) ( 0.5 , 0.5 ) , ( 0.5 , 0.5 )
R ¯ ( 2 ) = ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ( 0.3 , 0.3 ) , ( 0.5 , 0.4 ) ( 0.5 , 0.5 ) , ( 0.4 , 0.1 ) ( 0.8 , 0.3 ) , ( 0.1 , 0.5 ) ( 0.2586 , 0.1032 ) , ( 0.5115 , 0.6070 ) ( 0.5 , 0.4 ) , ( 0.3 , 0.3 ) ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ( 0.7 , 0.5 ) , ( 0.2 , 0.5 ) ( 0.3775 , 0.1392 ) , ( 0.3911 , 0.6953 ) ( 0.6 , 0.3 ) , ( 0.2 , 0.1 ) ( 0.4 , 0.1 ) , ( 0.5 , 0.5 ) ( 0.2 , 0.5 ) , ( 0.7 , 0.5 ) ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ( 0.8 , 0.3 ) , ( 0.2 , 0.7 ) ( 0.8 , 0.2 ) , ( 0.1 , 0.5 ) ( 0.1 , 0.5 ) , ( 0.8 , 0.3 ) ( 0.3911 , 0.6953 ) , ( 0.3775 , 0.1392 ) ( 0.2 , 0.7 ) , ( 0.8 , 0.3 ) ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ( 0.3 , 0.4 ) , ( 0.4 , 0.5 ) ( 0.5112 , 0.6070 ) , ( 0.2586 , 0.1032 ) ( 0.2 , 0.1 ) , ( 0.6 , 0.3 ) ( 0.1 , 0.5 ) , ( 0.8 , 0.2 ) ( 0.4 , 0.5 ) , ( 0.3 , 0.4 ) ( 0.5 , 0.5 ) , ( 0.5 , 0.5 )
R ¯ ( 3 ) = ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ( 0.3 , 0.3 ) , ( 0.5 , 0.4 ) ( 0.1193 , 0.1992 ) , ( 0.7313 , 0.5772 ) ( 0.4 , 0.5 ) , ( 0.4 , 0.1 ) ( 0.8 , 0.3 ) , ( 0.1 , 0.5 ) ( 0.5 , 0.4 ) , ( 0.3 , 0.3 ) ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ( 0.2 , 0.5 ) , ( 0.4 , 0.5 ) ( 0.9 , 0.3 ) , ( 0.1 , 0.1 ) ( 0.3567 , 0.1119 ) , ( 0.4016 , 0.6597 ) ( 0.7313 , 0.5772 ) , ( 0.1193 , 0.1992 ) ( 0.4 , 0.5 ) , ( 0.2 , 0.5 ) ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ( 0.6 , 0.3 ) , ( 0.3 , 0.7 ) ( 0.7 , 0.2 ) , ( 0.3 , 0.5 ) ( 0.4 , 0.1 ) , ( 0.4 , 0.5 ) ( 0.1 , 0.1 ) , ( 0.9 , 0.3 ) ( 0.3 , 0.7 ) , ( 0.6 , 0.3 ) ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ( 0.9 , 0.4 ) , ( 0.1 , 0.5 ) ( 0.1 , 0.5 ) , ( 0.8 , 0.3 ) ( 0.4016 , 0.6597 ) , ( 0.3567 , 0.1119 ) ( 0.3 , 0.5 ) , ( 0.7 , 0.2 ) ( 0.1 , 0.5 ) , ( 0.9 , 0.4 ) ( 0.5 , 0.5 ) , ( 0.5 , 0.5 )
R ¯ ( 4 ) = ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ( 0.4 , 0.3 ) , ( 0.6 , 0.4 ) ( 0.0800 , 0.1500 ) , ( 0.7600 , 0.700 ) ( 0.0480 , 0.0450 ) , ( 0.8080 , 0.9100 ) ( 0.0432 , 0.0180 ) , ( 0.8272 , 0.9550 ) ( 0.6 , 0.4 ) , ( 0.4 , 0.3 ) ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ( 0.2 , 0.5 ) , ( 0.4 , 0.5 ) ( 0.0592 , 0.0520 ) , ( 0.7648 , 0.9030 ) ( 0.0374 , 0.0122 ) , ( 0.8520 , 0.9613 ) ( 0.7600 , 0.700 ) , ( 0.0800 , 0.1500 ) ( 0.4 , 0.5 ) , ( 0.2 , 0.5 ) ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ( 0.6 , 0.3 ) , ( 0.2 , 0.7 ) ( 0.0642 , 0.0208 ) , ( 0.7613 , 0.9536 ) ( 0.8080 , 0.9100 ) , ( ( 0.0480 , 0.0450 ) ( 0.7648 , 0.9030 ) , ( 0.0592 , 0.0520 ) ( 0.2 , 0.7 ) , ( 0.6 , 0.3 ) ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ( 0.9 , 0.4 ) , ( 0.1 , 0.5 ) ( 0.8272 , 0.9550 ) , ( 0.0432 , 0.0180 ) ( 0.8520 , 0.9613 ) , ( 0.0374 , 0.0122 ) ( 0.7613 , 0.9536 ) , ( 0.0642 , 0.0208 ) ( 0.1 , 0.5 ) , ( 0.9 , 0.4 ) ( 0.5 , 0.5 ) , ( 0.5 , 0.5 )
Step 2. Utilize the complex intuitionistic fuzzy arithmetic averaging operator
b ˜ i ( k ) = 1 5 j = 1 5 a ˜ ¯ i j ( k ) , i = 1 , 2 , 3 , 4 , 5
to aggregate all a ˜ ¯ i j ( k ) ( j = 1 , 2 , 3 , 4 , 5 ) corresponding to the alternative V i , and then get the averaged complex intuitionistic fuzzy value b ˜ i ( k ) of the alternative V i over all the other alternatives as follows
b ˜ 1 ( 1 ) = ( ( 0.4434 , 0.3604 ) , ( 0.5047 , 0.4816 ) ) , b ˜ 2 ( 1 ) = ( ( 0.4585 , 0.3778 ) , ( 0.3028 , 0.3458 ) ) ,
b ˜ 3 ( 1 ) = ( ( 0.5318 , 0.3392 ) , ( 0.2759 , 0.5348 ) ) , b ˜ 4 ( 1 ) = ( ( 0.5445 , 0.5090 ) , ( 0.3167 , 0.3094 ) ) ,
b ˜ 5 ( 1 ) = ( ( 0.3204 , 0.5370 ) , ( 0.5203 , 0.2664 ) ) , b ˜ 1 ( 2 ) = ( ( 0.5182 , 0.3571 ) , ( 0.3842 , 0.3603 ) ) ,
b ˜ 2 ( 2 ) = ( ( 0.5489 , 0.3817 ) , ( 0.2979 , 0.3495 ) ) , b ˜ 3 ( 2 ) = ( ( 0.6051 , 0.3392 ) , ( 0.3227 , 0.5348 ) ) ,
b ˜ 4 ( 2 ) = ( ( 0.3126 , 0.5760 ) , ( 0.5455 , 0.3156 ) ) , b ˜ 5 ( 2 ) = ( ( 0.3622 , 0.4641 ) , ( 0.4508 , 0.2622 ) ) ,
b ˜ 1 ( 3 ) = ( ( 0.4829 , 0.3715 ) , ( 0.3740 , 0.3567 ) ) , b ˜ 2 ( 3 ) = ( ( 0.5813 , 0.3778 ) , ( 0.2995 , 0.3499 ) ) ,
b ˜ 3 ( 3 ) = ( ( 0.6045 , 0.4319 ) , ( 0.2548 , 0.4449 ) ) , b ˜ 4 ( 3 ) = ( ( 0.5478 , 0.4077 ) , ( 0.4043 , 4076 ) ) ,
b ˜ 5 ( 3 ) = ( ( 0.2987 , 0.5370 ) , ( 0.6176 , 0.2664 ) ) , b ˜ 1 ( 4 ) = ( ( 0.2413 , 0.2253 ) , ( 0.6864 , 0.6562 ) ) ,
b ˜ 2 ( 4 ) = ( ( 0.3205 , 0.3247 ) , ( 0.5539 , 0.5791 ) ) , b ˜ 3 ( 4 ) = ( ( 0.5146 , 0.4477 ) , ( 0.2613 , 0.4783 ) ) ,
b ˜ 4 ( 4 ) = ( ( 0.7173 , 0.7606 ) , ( 0.1535 , 0.1774 ) ) , b ˜ 5 ( 4 ) = ( ( 0.6926 , 0.8849 ) , ( 0.1361 , 0.0620 ) ) .
Step 3. Utilize Algorithm 4 to calculate the weight vector of decision-makers as follows
w = ( 0.2833 , 0.3039 , 0.3243 , 0.0885 ) T .
Step 4. Utilize the complex intuitionistic fuzzy weighted arithmetic averaging operator
b ˜ i = k = 1 4 w k b ˜ i ( k ) , i = 1 , 2 , 3 , 4 , 5
to aggregate all b ˜ i ( k ) ( k = 1 , 2 , 3 , 4 ) corresponding to four decision-makers into a collective complex intuitionistic fuzzy value b ˜ i of the alternative V i over all the other alternatives as follows
b ˜ 1 = ( ( 0.4654 , 0.3521 ) , ( 0.4331 , 0.4111 ) ) , b ˜ 2 = ( ( 0.5192 , 0.3744 ) , ( 0.3167 , 0.3645 ) ) ,
b ˜ 3 = ( ( 0.5777 , 0.3807 ) , ( 0.2806 , 0.4988 ) ) , b ˜ 4 = ( ( 0.5063 , 0.5316 ) , ( 0.3793 , 0.3215 ) ) ,
b ˜ 5 = ( ( 0.3722 , 0.5721 ) , ( 0.4677 , 0.2331 ) ) .
Step 5. Rank all the b ˜ i ( i = 1 , 2 , 3 , 4 , 5 ) by means of the score Function (1) and the accuracy Function (2), and then rank all the alternatives V i ( i = 1 , 2 , 3 , 4 , 5 ) and select the best one in accordance with the values of b ˜ i ( i = 1 , 2 , 3 ) . Since
S ( b ˜ 1 ) = 0.0267 , S ( b ˜ 2 ) = 0.2124 , S ( b ˜ 3 ) = 0.1790 , S ( b ˜ 4 ) = 0.3371 , S ( b ˜ 5 ) = 0.2345 ,
hence, the ranking order of alternatives is
V 4 > V 5 > V 2 > V 3 > V 1 .
Finally, we use Algorithm 6 to prioritize the online course platform, which involves the following steps.
Step 1. Utilize Algorithm 3 to construct the complete complex intuitionistic fuzzy preference relations R ¯ ( k ) = ( a ˜ ¯ i j ( k ) ) 5 × 5 of R ( k ) = ( a ˜ i j ( k ) ) 5 × 5 ( k = 1 , 2 , 3 , 4 ) as follows
R ¯ ( 1 ) = ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ( 0.3 , 0.3 ) , ( 0.6 , 0.4 ) ( 0.4 , 0.5 ) , ( 0.5 , 0.1 ) ( 0.5 , 0.2276 ) , ( 0.1714 , 0.1374 ) ( 0.3 , 0.7 ) , ( 0.3 , 0.5 ) ( 0.6 , 0.4 ) , ( 0.3 , 0.3 ) ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ( 0.2 , 0.5 ) , ( 0.4 , 0.5 ) ( 0.6 , 0.3 ) , ( 0.1 , 0.1 ) ( 0.5286 , 0.2111 ) , ( 0.0775 , 0.3 ) ( 0.5 , 0.1 ) , ( 0.4 , 0.5 ) ( 0.4 , 0.5 ) , ( 0.2 , 0.5 ) ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ( 0.7 , 0.3 ) , ( 0.2 , 0.7 ) ( 0.5 , 0.2 ) , ( 0.2 , 0.5 ) ( 0.1714 , 0.1374 ) , ( 0.5 , 0.2276 ) ( 0.1 , 0.1 ) , ( 0.6 , 0.3 ) ( 0.2 , 0.7 ) , ( 0.7 , 0.3 ) ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ( 0.8 , 0.4 ) , ( 0.1 , 0.5 ) ( 0.3 , 0.5 ) , ( 0.7 , 0.3 ) ( 0.0775 , 0.3 ) , ( 0.5286 , 0.2111 ) ( 0.2 , 0.5 ) , ( 0.5 , 0.2 ) ( 0.1 , 0.5 ) , ( 0.8 , 0.4 ) ( 0.5 , 0.5 ) , ( 0.5 , 0.5 )
R ¯ ( 2 ) = ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ( 0.3 , 0.3 ) , ( 0.5 , 0.4 ) ( 0.5 , 0.5 ) , ( 0.4 , 0.1 ) ( 0.8 , 0.3 ) , ( 0.1 , 0.5 ) ( 0.6076 , 0.1925 ) , ( 0.1126 , 0.2230 ) ( 0.5 , 0.4 ) , ( 0.3 , 0.3 ) ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ( 0.7 , 0.5 ) , ( 0.2 , 0.5 ) ( 0.9032 , 0.3 ) ) , ( 0.0588 , 0.7 ) ( 0.6 , 0.3 ) , ( 0.2 , 0.1 ) ( 0.4 , 0.1 ) , ( 0.5 , 0.5 ) ( 0.2 , 0.5 ) , ( 0.7 , 0.5 ) ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ( 0.8 , 0.3 ) , ( 0.2 , 0.7 ) ( 0.8 , 0.2 ) , ( 0.1 , 0.5 ) ( 0.1 , 0.5 ) , ( 0.8 , 0.3 ) ( 0.0588 , 0.7 ) , ( 0.9032 , 0.3 ) ( 0.2 , 0.7 ) , ( 0.8 , 0.3 ) ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ( 0.3 , 0.4 ) , ( 0.4 , 0.5 ) ( 0.1126 , 0.2230 ) , ( 0.6076 , 0.1925 ) ( 0.2 , 0.1 ) , ( 0.6 , 0.3 ) ( 0.1 , 0.5 ) , ( 0.8 , 0.2 ) ( 0.4 , 0.5 ) , ( 0.3 , 0.4 ) ( 0.5 , 0.5 ) , ( 0.5 , 0.5 )
R ¯ ( 3 ) = ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ( 0.3 , 0.3 ) , ( 0.5 , 0.4 ) ( 0.0968 , 0.3 ) , ( 0.4 , 0.4 ) ( 0.4 , 0.5 ) , ( 0.4 , 0.1 ) ( 0.8 , 0.3 ) , ( 0.1 , 0.5 ) ( 0.5 , 0.4 ) , ( 0.3 , 0.3 ) ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ( 0.2 , 0.5 ) , ( 0.4 , 0.5 ) ( 0.9 , 0.3 ) ) , ( 0.1 , 0.1 ) ( 0.6781 , 0.2111 ) , ( 0.1172 , 0.3 ) ( 0.4 , 0.4 ) , ( 0.0968 , 0.3 ) ( 0.4 , 0.5 ) , ( 0.2 , 0.5 ) ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ( 0.6 , 0.3 ) , ( 0.3 , 0.7 ) ( 0.7 , 0.2 ) , ( 0.3 , 0.5 ) ( 0.4 , 0.1 ) , ( 0.4 , 0.5 ) ( 0.1 , 0.1 ) , ( 0.9 , 0.3 ) ( 0.3 , 0.7 ) , ( 0.6 , 0.3 ) ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ( 0.9 , 0.4 ) , ( 0.1 , 0.5 ) ( 0.1 , 0.5 ) , ( 0.8 , 0.3 ) ( 0.1172 , 0.3 ) , ( 0.6781 , 0.2111 ) ( 0.3 , 0.5 ) , ( 0.7 , 0.2 ) ( 0.1 , 0.5 ) , ( 0.9 , 0.4 ) ( 0.5 , 0.5 ) , ( 0.5 , 0.5 )
R ¯ ( 4 ) = ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ( 0.4 , 0.3 ) , ( 0.6 , 0.4 ) ( 0.1429 , 0.3 ) , ( 0.5 , 0.4 ) ( 0.2001 , 0.1552 ) , ( 0.2 , 0.6087 ) ( 0.6924 , 0.1091 ) , ( 0.027 , 0.6087 ) ( 0.6 , 0.4 ) , ( 0.4 , 0.3 ) ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ( 0.2 , 0.5 ) , ( 0.4 , 0.5 ) ( 0.2727 , 0.3 ) ) , ( 0.1429 , 0.7 ) ( 0.7714 , 0.2222 ) , ( 0.0182 , 0.7 ) ( 0.5 , 0.4 ) , ( 0.1429 , 0.3 ) ( 0.4 , 0.5 ) , ( 0.2 , 0.5 ) ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ( 0.6 , 0.3 ) , ( 0.2 , 0.7 ) ( 0.931 , 0.2222 ) , ( 0.027 , 0.7 ) ( 0.2 , 0.6087 ) , ( 0.2001 , 0.1552 ) ( 0.1429 , 0.7 ) , ( 0.2727 , 0.3 ) ( 0.2 , 0.7 ) , ( 0.6 , 0.3 ) ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ( 0.9 , 0.4 ) , ( 0.1 , 0.5 ) ( 0.027 , 0.6087 ) , ( 0.6924 , 0.1091 ) ( 0.0182 , 0.7 ) , ( 0.7714 , 0.2222 ) ( 0.027 , 0.7 ) , ( 0.931 , 0.2222 ) ( 0.1 , 0.5 ) , ( 0.9 , 0.4 ) ( 0.5 , 0.5 ) , ( 0.5 , 0.5 )
Step 2. Utilize Algorithm 4 to calculate the weight vector of decision-makers as follows
w = ( 0.2693 , 0.2334 , 0.2587 , 0.2386 ) T .
Step 3. Utilize the complex intuitionistic fuzzy weighted averaging operator to aggregate all individual complete complex intuitionistic fuzzy preference relations R ¯ ( k ) ( k = 1 , 2 , 3 , 4 ) together with the experts’ weights w k ( k = 1 , 2 , 3 , 4 ) into the collective complete complex intuitionistic fuzzy preference R = ( a ˜ i j ) 5 × 5 as follows
R = ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ( 0.3239 , 0.3 ) , ( 0.5507 , 0.4 ) ( 0.2836 , 0.4005 ) , ( 0.4508 , 0.2492 ) ( 0.4726 , 0.2977 ) , ( 0.2207 , 0.3248 ) ( 0.5948 , 0.3371 ) , ( 0.1394 , 0.4613 ) ( 0.5507 , 0.4 ) , ( 0.3239 , 0.3 ) ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ( 0.3167 , 0.5 ) , ( 0.3533 , 0.5 ) ( 0.6703 , 0.3 ) ) , ( 0.1006 , 0.3832 ) ( 0.6419 , 0.2345 ) , ( 0.1022 , 0.3488 ) ( 0.4508 , 0.2492 ) , ( 0.2836 , 0.4005 ) ( 0.3533 , 0.5 ) , ( 0.3167 , 0.5 ) ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ( 0.6736 , 0.3 ) , ( 0.2259 , 0.7 ) ( 0.7246 , 0.2053 ) , ( 0.1613 , 0.5477 ) ( 0.2207 , 0.3248 ) , ( 0.4726 , 0.2977 ) ( 0.1006 , 0.3832 ) , ( 0.6703 , 0.3 ) ( 0.2259 , 0.7 ) , ( 0.6736 , 0.3 ) ( 0.5 , 0.5 ) , ( 0.5 , 0.5 ) ( 0.7330 , 0.4 ) , ( 0.1700 , 0.5 ) ( 0.1394 , 0.4613 ) , ( 0.5948 , 0.3371 ) ( 0.1022 , 0.3488 ) , ( 0.6419 , 0.2345 ) ( 0.1613 , 0.5477 ) , ( 0.7246 , 0.2053 ) ( 0.1700 , 0.5 ) , ( 0.7330 , 0.4 ) ( 0.5 , 0.5 ) , ( 0.5 , 0.5 )
Step 4. Utilize the complex intuitionistic fuzzy averaging operator
r i = 1 5 j = 1 5 r i j , ω μ i = 1 5 j = 1 5 ω μ i j , s i = 1 5 j = 1 5 s i j , ω ν i = 1 5 j = 1 5 ω ν i j , i = 1 , 2 , 3 , 4 , 5
to aggregate all a ˜ i j corresponding to four decision-makers into a collective complex intuitionistic fuzzy value b ˜ i = ( ( r i , ω μ i ) , ( s i , ω ν i ) ) of the alternative V i over all the other alternatives as follows
b ˜ 1 = ( ( 0.4350 , 0.3671 ) , ( 0.3723 , 0.3871 ) ) , b ˜ 2 = ( ( 0.5359 , 0.3869 ) , ( 0.2760 , 0.4064 ) ) ,
b ˜ 3 = ( ( 0.5405 , 0.3509 ) , ( 0.2975 , 0.5296 ) ) , b ˜ 4 = ( ( 0.3560 , 0.4616 ) , ( 0.4973 , 0.3795 ) ) ,
b ˜ 5 = ( ( 0.2146 , 0.4716 ) , ( 0.6389 , 0.3354 ) ) .
Step 5. Rank all the b ˜ i ( i = 1 , 2 , 3 , 4 , 5 ) by means of the score Function (4) and the accuracy Function (5), and then rank all the alternatives V i ( i = 1 , 2 , 3 , 4 , 5 ) and select the best one in accordance with the values of b ˜ i ( i = 1 , 2 , 3 , 4 , 5 ) . Since
S ( b ˜ 1 ) = 0.0427 , S ( b ˜ 2 ) = 0.2404 , S ( b ˜ 3 ) = 0.0643 , S ( b ˜ 4 ) = 0.0592 , S ( b ˜ 5 ) = 0.2881 ,
hence, the ranking order of alternatives is
V 2 > V 3 > V 1 > V 4 > V 5 .
From the numerical results above, it can be clearly seen that the rankings of the locations V i ( i = 1 , 2 , 3 , 4 , 5 ) obtained by Algorithms 5 and 6 differ significantly. By Algorithm 6, V 2 is ranked the first, then V 3 , V 1 and V 4 , respectively, and then V 5 the last. However, by Algorithm 5, V 2 drops from the first to the third, V 3 from the second to the forth, and V 1 from the third to the last, while V 4 moves up from the fourth to the first, and V 5 from the last to the second (which changes the most among all the locations). Table 2 reflects these changes.
We also observe that the distinct changes in the rankings of the locations are mainly caused by the substantial differences among the estimated elements in the incomplete complex intuitionistic fuzzy preference relation R ( 4 ) when using Algorithms 5 and 6. In the process of estimating missing elements, the estimation Formula (15) in the Algorithm 5 results in the decrease of the membership degrees and the increase of the non-membership degrees of complex intuitionistic fuzzy preference values sharply, which produce distortion of the estimated information, but the estimation Formula (16) in Algorithm 6, which is motivated by the multiplicative transitivity of traditional complex intuitionistic fuzzy preference relations, can overcome this issue by making the estimated results more intuitive and reasonable.
Compared with Algorithm 5, Algorithm 6 has the following advantages.
(i) The estimation formulas (10)–(13) used in Algorithm 6 are natural extensions of multiplicative transitivity Formulas (3) and (4) of traditional intuitionistic fuzzy preference relations. The estimation formula used in Algorithm 5, however, sometimes may produce distortion of the estimated information.
(ii) The complex intuitionistic fuzzy weighted averaging operator and the complex intuitionistic fuzzy averaging operator are consistent with the aggregation operations on the ordinary intuitionistic fuzzy sets. These two aggregation operators are also monotone with respect to the total order based on the scores and accuracy degrees. But the aggregation operators used in Algorithm 5 are only monotone with respect to the partial order. As a result, Algorithm 6 is more intuitive and reasonable and thus has good application prospects.
Based on the analysis above, we will take the calculation result of the Algorithm 6 as the decision-making result, for example 7, that is, the ranking order of alternatives is V 2 > V 3 > V 1 > V 4 > V 5 .
Remark 4.
In this paper, the simulation verification of an incomplete complex intuitionistic fuzzy system is carried out by MATLAB software with the help of Example 7. According to Definition 5, complex intuitionistic fuzzy numbers are aggregated by creating numerical formulas in MATLAB software. Meanwhile, the best alternative is selected using the score function value and accuracy function value. Simulation results show that the algorithm proposed in this paper is accurate and effective, and is suitable for group decision-making problems that contain periodic changes of uncertain information.

7. Conclusions

In this paper, firstly, we introduced the concept of incomplete complex intuitionistic fuzzy preference relation and discussed its properties. Meanwhile, the concept of multiplicative consistent incomplete complex intuitionistic fuzzy preference relations are defined and three estimation algorithms are developed to estimate the missing elements in the acceptable incomplete complex intuitionistic fuzzy preference relations. Finally, the group decision-making algorithms based on incomplete complex intuitionistic fuzzy preference relation are established and the solving process of the algorithms is illustrated by an example, the practicability of the algorithms is verified, and the advantages and disadvantages of group decision-making algorithms are compared and analyzed. As a result, the resulting put forward in this paper is more intuitive and reasonable and thus has good application prospects.
We note that the estimation algorithms (i.e., Algorithms 1–3) for the acceptable incomplete complex intuitionistic fuzzy preference relations are used to translate incomplete complex intuitionistic fuzzy preference relations to complete complex intuitionistic fuzzy preference relations, and the expert weight determination algorithm (i.e., Algorithm 4) is used to calculate the expert weights. Finally, group decision-making algorithms (i.e., Algorithms 5 and 6) based on incomplete complex intuitionistic fuzzy reference relations are used to solve group decision-making problems and select the best alternatives. Although both Algorithms 5 and 6 are group decision-making algorithms, there are advantages of Algorithm 6 compared with Algorithm 5, that is, (i) the estimation formulas used in Algorithm 6 are natural extensions of multiplicative transitivity formulas of traditional intuitionistic fuzzy preference relations, which can avoid distorting the complex intuitionistic fuzzy preference information in the estimation process; (ii) The complex intuitionistic fuzzy weighted averaging operator and the complex intuitionistic fuzzy averaging operator are consistent with the aggregation operations on the ordinary intuitionistic fuzzy sets. These two aggregation operators are also monotone with respect to the total order based on the scores and accuracy degrees. However, the aggregation operators used in Algorithm 5 are only monotone with respect to the partial order. As a result, Algorithm 6 is more intuitive and reasonable and thus has good application prospects. We have used a practical example of an educational institute selecting an online course platform to compare and analyze Algorithms 5 and 6 and verify the practicality and superiority of Algorithm 6. Finally, note that complex intuitionistic fuzzy number itself is more complex, so the algorithms proposed in this paper have a large amount of computation. We mainly use MATLAB software for calculation. Meanwhile, the simulation verification of incomplete complex intuitionistic fuzzy system is carried out by MATLAB software with the help of Example 7. Simulation results show that the algorithm proposed in this paper is accurate and effective, and is suitable for group decision making problems that contain periodic changes of uncertain information.

Author Contributions

Conceptualization Z.G.; investigation, F.W. and Y.S. All authors have read and agreed to the published version of the manuscript.

Funding

This research was supported by the National Natural Science Foundation of China (No. 12061067); the Youth Science and Technology Innovation Project of Lanzhou Institute of Technology (18K-018).

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Acknowledgments

The authors would like to thank the referees for providing very helpful comments and suggestions.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Alonso, S.; Herrera-Viedma, E.; Chiclana, F.; Herrera, F. A web based consensus support system for group decision making problems and incomplete preferences. Inf. Sci. 2010, 180, 4477–4495. [Google Scholar] [CrossRef]
  2. Gong, Z.W.; Li, L.S.; Forrest, J.; Zhao, Y. The optimal priority models of the intuitionistic fuzzy preference relation and their application in selecting industries with higher meteorological sensitivity. Expert Syst. Appl. Int. J. 2011, 38, 4394–4402. [Google Scholar] [CrossRef]
  3. Kou, G.; Peng, Y.; Chen, Z.; Shi, Y. Multiple criteria mathematical programming for multi-class classification and application in network intrusion detection. Inf. Sci. 2009, 179, 371–381. [Google Scholar] [CrossRef]
  4. Srdjevic, B.; Srdjevic, Z.; Zoranovic, T.; Suvocarev, K. Group decision-making in selecting nanotechnology supplier: AHP application in presence of complete and incomplete information. Nanomater. Risks Benefits 2005, 5, 409–422. [Google Scholar]
  5. Xia, M.M.; Xu, Z.S.; Liao, H.C. Preference relations based on intuitionistic multiplicative information. IEEE Trans. Fuzzy Syst. 2013, 21, 113–133. [Google Scholar]
  6. Xu, Z.S. Priority weight intervals derived from intuitionistic multiplicative preference. IEEE Trans. Fuzzy Syst. 2013, 21, 642–654. [Google Scholar]
  7. Xu, Z.S. A survey of preference relations. Int. J. Gen. Syst. 2007, 36, 179–203. [Google Scholar] [CrossRef]
  8. Chen, M.; Lin, W.; Zhou, L. Consistency analysis and priority weights for Pythagorean fuzzy preference relations. IEEE Access 2020, 8, 89106–89116. [Google Scholar] [CrossRef]
  9. Garg, H. Distance and similarity measures for intuitionistic multiplicative preference relation and its applications. Int. J. Uncertain. Quantif. 2017, 7, 117–133. [Google Scholar] [CrossRef]
  10. Jin, F.; Garg, H.; Pei, L.; Liu, J.; Chen, H. Multiplicative consistency adjustment model and data envelopment analysis-driven decision-making process with probabilistic hesitant fuzzy preference relations. Int. J. Fuzzy Syst. 2020, 22, 2319–2332. [Google Scholar] [CrossRef]
  11. Li, H.; Yin, S.; Yang, Y. Some preference relations based on q-rung orthopair fuzzy sets. Int. J. Intell. Syst. 2019, 34, 2920–2936. [Google Scholar] [CrossRef]
  12. Lin, M.; Zhan, Q.; Xu, Z.S.; Chen, R. Group decision making with probabilistic hesitant multiplicative preference relations based on consistency and consensus. IEEE Access 2018, 6, 63329–63344. [Google Scholar] [CrossRef]
  13. Lin, M.; Zhan, Q.; Xu, Z.S.; Chen, R. Group decision-making model with hesitant multiplicative preference relations based on regression method and feedback mechanism. IEEE Access 2018, 6, 61130–61150. [Google Scholar] [CrossRef]
  14. Mandal, P.; Ranadive, A.S. Pythagorean fuzzy preference relations and their applications in group decision-making systems. Int. J. Intell. Syst. 2019, 34, 1700–1717. [Google Scholar] [CrossRef]
  15. Viedma, E.H.; Chiclana, F.; Herrera, F.; Alonso, S. Group decision-making model with incomplete fuzzy preference relations based on additive consistency. IEEE Trans. Syst. Man Cybern. Part B 2007, 37, 176–189. [Google Scholar] [CrossRef]
  16. Wang, Z.J. Derivation of intuitionistic fuzzy weights based on intuitionistic fuzzy preference relations. Appl. Math. Model. 2013, 37, 6377–6388. [Google Scholar] [CrossRef]
  17. Wang, Z.J.; Li, K.W. Goal programming approaches to deriving interval weights based on interval fuzzy preference relations. Inf. Sci. 2012, 193, 180–198. [Google Scholar] [CrossRef]
  18. Xu, Y.; Herrera, F. Visualizing and rectifying different inconsistencies for fuzzy reciprocal preference relations. Fuzzy Sets Syst. 2019, 362, 85–109. [Google Scholar] [CrossRef]
  19. Xu, Z.S. Intuitionistic preference relations and their application in group decision making. Inf. Sci. 2007, 177, 2363–2379. [Google Scholar] [CrossRef]
  20. Xu, Z.S.; Cai, X.; Szmidt, E. Algorithms for estimating missing elements of incomplete intuitionistic preference relations. Int. J. Intell. Syst. 2011, 26, 787–813. [Google Scholar] [CrossRef]
  21. Xu, Z.S.; Yager, R.R. Some geometric aggregation operators based on intuitionistic fuzzy sets. Int. J. Gen. Syst. 2006, 35, 417–433. [Google Scholar] [CrossRef]
  22. Zhang, C.; Liao, H.; Luo, L. Additive consistency-based priority-generating method of q-rung orthopair fuzzy preference relation. Int. J. Intell. Syst. 2019, 34, 2151–2176. [Google Scholar] [CrossRef]
  23. Ramot, D.; Milo, R.; Friedman, M.; Kandel, A. Complex fuzzy sets. IEEE Trans. Fuzzy Syst. 2002, 10, 171–186. [Google Scholar] [CrossRef]
  24. Yazdanbakhsh, O.; Dick, S. A systematic review of complex fuzzy sets and logic. Fuzzy Sets Syst. 2018, 338, 1–22. [Google Scholar] [CrossRef]
  25. Alkouri, A.U.M. Complex intuitionistic fuzzy sets. Int. Conf. Fundam. Appl. Sci. Aip Conf. Proc. 2012, 1482, 464–470. [Google Scholar]
  26. Alkouri, A.U.M.; Salleh, A.R. Some operations on complex Atanassov’s intuitionistic fuzzy sets. Int. Conf. Fundam. Appl. Sci. Aip Conf. Proc. 2013, 1571, 987–993. [Google Scholar]
  27. Alkouri, A.U.M.; Salleh, A.R. Complex Atanassov’s intuitionistic fuzzy relation. Abstr. Appl. Anal. 2013, 2013, 1–18. [Google Scholar] [CrossRef]
  28. Garg, H.; Rani, D. Some generalized complex intuitionistic fuzzy aggregation operators and their application to multicriteria decision-making process. Arab. J. Sci. Eng. 2019, 44, 2679–2698. [Google Scholar] [CrossRef]
  29. Garg, H.; Rani, D. Generalized geometric aggregation operators based on t-norm operations for complex intuitionistic fuzzy sets and their application to decision-making. Cogn. Comput. 2019, 12, 679–698. [Google Scholar] [CrossRef]
  30. Garg, H.; Rani, D. Robust averaging-geometric aggregation operators for complex intuitionistic fuzzy sets and their applications to MCDM process. Arab. J. Sci. Eng. 2020, 45, 2017–2033. [Google Scholar] [CrossRef]
  31. Garg, H.; Rani, D. Novel aggregation operators and ranking method for complex intuitionistic fuzzy sets and their applications to decision-making process. Artif. Intell. Rev. 2020, 53, 3595–3620. [Google Scholar] [CrossRef]
  32. Garg, H.; Rani, D. A robust correlation coefficient measure of complex intuitionistic fuzzy sets and their applications in decision-making. Appl. Intell. 2019, 49, 496–512. [Google Scholar] [CrossRef]
  33. Garg, H.; Rani, D. Exponential, logarithmic and compensative generalized aggregation operators under complex intuitionistic fuzzy environment. Group Decis. Negot. 2019, 28, 991–1050. [Google Scholar] [CrossRef]
  34. Rani, D.; Garg, H. Distance measures between the complex intuitionistic fuzzy sets and its applications to the decision-making process. Int. J. Uncertain. Quantif. 2017, 7, 423–439. [Google Scholar] [CrossRef]
  35. Rani, D.; Garg, H. Complex intuitionistic fuzzy preference relations and their applications in individual and group decision-making problems. Int. J. Intell. Syst. 2021, 36, 1800–1830. [Google Scholar] [CrossRef]
  36. Ibrahim, H.Z.; Al-Shami, T.M.; Elbarbary, O.G. (3,2)-fuzzy sets and their applications to topology and optimal choices. Comput. Intell. Neurosci. 2021, 2021, 1272266. [Google Scholar] [CrossRef]
  37. Mohammed, A.; Muhammad, I.A.; Tareq, M.A. Fuzzy soft covering-based multi-granulation fuzzy rough sets and their applications. Comput. Appl. Math. 2021, 40, 115. [Google Scholar]
Table 1. Mathematical symbols and definitions.
Table 1. Mathematical symbols and definitions.
Mathematical SymbolsDefinitions
AA complex fuzzy set
A ˜ A complex intuitionistic fuzzy set
CE ˜ The set of complex intuitionistic fuzzy numbers
S The score function
H The accuracy function
V The discrete set of alternatives
R The preference relation
B The intuitionistic preference relation
R The complex intuitionistic fuzzy preference relation
S A scoring matrix
S ¯ A mean scoring matrix
Table 2. Differences in the results obtained by the Algorithm 5 and Algorith.
Table 2. Differences in the results obtained by the Algorithm 5 and Algorith.
V 1 V 2 V 3 V 4 V 5
Algorithm 5 0.0267 0.2124 0.1790 0.3371 0.2435
Algorithm 6 0.0427 0.2404 0.0643 0.0592 0.2881
Differences 0.0694 0.0280 0.1147 0.3963 0.5316
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Wang, F.; Gong, Z.; Shao, Y. Incomplete Complex Intuitionistic Fuzzy System: Preference Relations, Expert Weight Determination, Group Decision-Making and Their Calculation Algorithms. Axioms 2022, 11, 418. https://doi.org/10.3390/axioms11080418

AMA Style

Wang F, Gong Z, Shao Y. Incomplete Complex Intuitionistic Fuzzy System: Preference Relations, Expert Weight Determination, Group Decision-Making and Their Calculation Algorithms. Axioms. 2022; 11(8):418. https://doi.org/10.3390/axioms11080418

Chicago/Turabian Style

Wang, Fangdi, Zengtai Gong, and Yabin Shao. 2022. "Incomplete Complex Intuitionistic Fuzzy System: Preference Relations, Expert Weight Determination, Group Decision-Making and Their Calculation Algorithms" Axioms 11, no. 8: 418. https://doi.org/10.3390/axioms11080418

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop