m -Polar Generalization of Fuzzy T -Ordering Relations: An Approach to Group Decision Making

: Recently, T -orderings, deﬁned based on a t -norm T and inﬁmum operator (for inﬁnite case) or minimum operator (for ﬁnite case), have been applied as a generalization of the notion of crisp orderings to fuzzy setting. When this concept is extending to m -polar fuzzy data, it is questioned whether the generalized deﬁnition can be expanded for any aggregation function, not necessarily the minimum operator, or not. To answer this question, the present study focuses on constructing m -polar T -orderings based on aggregation functions A , in particular, m -polar T preorderings (which are reﬂexive and transitive m -polar fuzzy relations w.r.t T and A ) and m -polar T -equivalences (which are symmetric m -polar T -preorderings). Moreover, the construction results for generating crisp preference relations based on m -polar T -orderings are obtained. Two algorithms for solving ranking problem in decision-making are proposed and validated by an illustrative example.


Introduction
In any decision situation, the pairwise comparison of alternatives for expressing the preferences is the essential part of extending an ordering model between objects. In realworld problems, this comparison information is usually expressed by linguistic variables or fuzzy preferences as they are known from their first appearance in 1971 (c.f. [1]). By adding the concept of membership degree to the binary relations, the class of fuzzy relations, introduced by Zadeh [1], provides more realistic environments for expressing of preferences over the set of alternatives that can be qualitative (linguistic) or quantitative (numeric).
Studies on fuzzy relations properties and fuzzy orderings have been received increasing attention [2][3][4][5][6][7][8][9]. Different researchers have attempted to generalize the basic concepts, such as reflexivity, symmetry, and transitivity for fuzzy relations; however, there is not a unique way for such development in fuzzy logic. While the notions of fuzzy reflexivity, fuzzy symmetry, and fuzzy antisymmetry depend only on the degrees of relations, the concept of fuzzy transitivity was defined by means of a binary operation * : [0, 1] 2 → [0, 1], especially where * is a t-norm T. Accordingly, different variants of fuzzy orderings, such as T-preorder, T-partial order, and T-equivalence relations, were introduced for fuzzy binary relations. Later, Bodenhofer [10,11] discussed the axioms of fuzzy reflexivity and fuzzy antisymmetry being too strong conditions for fuzzification of the crisp case. The new concepts of E-reflexivity, T-antisymmetry, and T − E-antisymmetry, where T is a t-norm and E is a T-equivalence relation, with less requirements were then developed.
In Boolean logic, there is a close relationship between implication and ordering. If P and Q are two statements, then P Q iff P → Q is a tautology. Accordingly, an equivalence relation can be defined over the set of statements where P ∼ Q iff P ↔ Q.
By using t-norms, the implication relations can be defined as operators associated with a t-norm T over the two-valued and multi-valued statements or in a general case for fuzzy sets. It was also proved that, for any implication operator, associated with the t-norm T, a fuzzy T-preordering and a fuzzy T-equivalence can be formulated based on T. This helps researchers to construct fuzzy orderings from degrees of inclusion and equality of fuzzy sets (c.f. [11][12][13][14] for more information). However, the relation of fuzzy sets inclusion used in literature, characterized based on the operators of fuzzy joint and fuzzy implication, represents only a single way of different possible ways to define fuzzy orderings based on t-norms. In particular, when we restrict ourselves to the case dealing with finite records of fuzzy information, the fuzzy joint is represented as a minimum operator that can be considered as a conjunctive aggregation function.
In most real-world group decision-making problems, we deal with multi-polar or multi-index information that arises from multi-source or multi-parameter data. In 1994, Zhang [15] initiated the concept of bipolar fuzzy sets whose membership degrees are in [−1, 1] instead of [0, 1] to model situations where objects can be considered to have a certain property and its counter. This framework is successfully applied when both positive and negative sides of information are given or when objects have positive or negative influence on each other. By extending the range of fuzzy sets from [0, 1] into the [0, 1] m that is [0, 1] × · · · × [0, 1] m-times, the concept of m-polar fuzzy set was introduced in [16,17] to cope with the problem of multi-polarity, where objects may have a relationship with each other in different directions based on various features of a given property. As a result, it is a very natural question regarding how the concept of T-orderings can be developed to m-polar fuzzy sets.
This paper contributes to generalizing the approach of construction fuzzy T-orderings for m-polar fuzzy data by extending the fuzzy joint operator to any aggregation functions. This generalized approach shows the close link between domination relationship of aggregation operators over t-norm T and the existence of m-polar T-orderings. The obtained results do not only present the construction methods, but they are also illustrated to show the efficiency of this new class of m-polar T-orderings for solving decision-making problems. In this regard, the rest of the present paper is organized as the following: Section 2 gives basic information that is needed to get the main results of the paper. Next, in Section 3, the implication operator is developed to m-polar fuzzy sets in order to generate new classes of m-polar T-preorderings and m-polar T-equivalences. By using a-cut relations, in Section 4, we discuss some construction methods to create crisp orderings from the proposed m-polar T-orderings. Two score function-based algorithms are designed for solving the problem of ranking in decision-making and then illustrated by a numerical example in Section 5. Lastly, the Conclusions section is presented.

Basic Definitions and Properties
In this section, we recall some theoretical background needed to develop the main results of this paper. Note that, throughout this paper, we use the following notations: 1], m-times, as the set of all m-dimensional real vectors whose components are in the interval I.
An extended aggregation function is the function A : n∈N [0, 1] n → [0, 1] whose restriction A| I n := A (n) to I n is the n-ary aggregation function A (n) for any n ∈ N.
The aggregation function A is called conjunctive if A(x 1 , · · · , x n ) ≤ min(x 1 , · · · , x n ), called disjunctive if A(x 1 , · · · , x n ) ≥ max(x 1 , · · · , x n ) and called average (idempotent) whenever min(x 1 , · · · , x n ) ≤ A(x 1 , · · · , x n ) ≤ max(x 1 , · · · , x n ) for every (x 1 , · · · , x n ) ∈ I n . In the general case, the conjunctive and disjunctive aggregation functions do not need to have neutral elements. However, if they have them, these elements are, respectively, e = 1 and e = 0. Moreover, if an aggregation function A has the neutral element e = 1, then it is necessarily conjunctive and, if it has the neutral element e = 0, then it is necessarily disjunctive.   1], or t-norms and t-conorms in brief, are well-known examples of conjunctive and disjunctive aggregation operators which are associative and commutative with the neutral elements e = 1 and e = 0, respectively (c.f. [22]).
There are four basic t-norms: In fact, the drastic product T D and the minimum operator T M are the smallest and the greatest t-norms, respectively, and T M is the only tnorm that is idempotent at any x ∈ [0, 1]. On the other hand, the dual of these operators, i.e., S D (x 1 , It is shown in literature (c.f. [22], Section 6.3) that the domination relation on the set of all t-norms is reflexive (i.e., T T) and antisymmetric (i.e., T 1 T 2 , T 2 T 1 ⇒ T 1 = T 2 ); however, the transitivity property is still an open problem. It is also proved that, for any two t-norms T 1 and T 2 , if T 1 T 2 , then T 1 ≥ T 2 , while the converse does not hold in general. The t-norms T and the t-conorms S are, in fact, different membership functions from model conjunction (i.e., the logical AND) and disjunction (i.e., the logical OR) in fuzzy logic. However, besides these, it is needed to interpret the concept of implication in fuzzy logic. Therefore, by using t-norms and t-conorms, a particular class of implication operators was formulated based on the classical concept of implication in set theory as follows.
x ≤ y if and only if − → Crisp binary relations, especially orders, are applied to explain the relationships between objects or to compare different objects. However, in real decision situations, we usually deal with the degree of preference not the simple case of yes or no comparison. By adding the membership degree to this Boolean information, binary relations are presented in the fuzzy logic-based framework that are called fuzzy binary relations (or FR in brief). In the sense of Zadeh [1], a fuzzy binary relation R from X to Y is a fuzzy subset of X × Y characterized by the membership function R : X × Y → [0, 1], where, for each pair (x, y) ∈ X × Y, the value R(x, y) shows the strength of the relationship between x and y.
The fuzzy relation R is: • fuzzy ordering if it is reflexive; • fuzzy preordering if it is reflexive and transitive; • fuzzy total or linear preordering if it is strongly complete and transitive; • fuzzy partial ordering or fuzzy weak preference ordering if it is reflexive, antisymmetric and transitive; • fuzzy strict preference ordering if it is antisymmetric and transitive; • similarity relation or fuzzy equivalence relation if it is reflexive, symmetric, and transitive.
Accordingly, fuzzy T-orderings or in general case fuzzy * -orderings can be defined as below.
In the direction of generalization of the fuzzy orderings, some researchers pointed out that the above definitions are a straightforward extension of the associated concepts in a crisp case without taking the deeper algebraic background into account. Since the concept of equality in the above definitions is indeed the crisp concept and not a fuzzy equality, the class of * -orderings (or T-orderings where T is a t-norm) are just half-way fuzzification of crisp orderings. Therefore, the following definitions were suggested.

Definition 6 ([10,11]). Let T be a t-norm and E be a fuzzy T-equivalence relation. The fuzzy binary relation R is called T-E-ordering if and only if it is
1.
Valverde [14] showed that there is a link between the implication and biimplication operators and fuzzy T-orderings which can help us to construct a fuzzy T-preorder R and a fuzzy T-equivalence E from fuzzy data. The background idea of constructing these T-orderings is followed from measuring the degrees of T-inclusion and T-similarity of fuzzy sets.

Theorem 1 ([14]
). For an arbitrary left-continuous t-norm T, the fuzzy relation R on X is Tpreorder if and only if there exists a family of {µ j } j∈J of fuzzy subsets of X such that for all x, y ∈ X.

Theorem 2 ([14]
). For an arbitrary left-continuous t-norm T, the fuzzy relation R on X is Tequivalence if and only if there exists a family of {µ j } j∈J of fuzzy subsets of X such that for all x, y ∈ X.

m-Polar Fuzzy Relations
By expanding the range of membership function from the unit interval [0 1] where 0 = (0, 0, · · · , 0) and 1 = (1, 1, · · · , 1) are, respectively, the least and greatest elements, the traditional fuzzy set, dealing with uni-polar data, is extended into the new concept of m-polar fuzzy set which can deal with multi-polar information.
Definition 7 ([16]). An m-polar fuzzy set µ on the universe X is a mapping µ : 1] is the sth projection mapping. The set [0, 1] m is considered as a poset with order "≤" such that for any x, y ∈ [0, 1] m where x = (x 1 , · · · , x m ) and y = (y 1 , · · · , y m ), For any two m-polar fuzzy subsets µ and ν of the universe X, the union and intersection are computed as the following: The concept of m-polar fuzzy relation is also developed as below.

Definition 8 ([25]
). An m-polar fuzzy relation R on the universe X is defined by a mapping R : shows the sth degree of relationship between x and y.
Let R be an m-polar fuzzy relation on X. Analogously to the fuzzy relations, if the m-tuple a = (a 1 , · · · , a m ) ∈ (0, 1] m is a given threshold vector on membership degrees, then R a = {(x, y) ∈ X 2 : π s • R(x, y) ≥ a s : s = 1, 2, · · · , m} is a non-fuzzy (crisp) binary relation on X that is called a-level relation generated by R. Clearly, for any two given threshold vectors a, b ∈ (0, 1] m such that a = (a 1 , · · · , a m ) The aggregating process of n fuzzy relations R 1 , · · · , R n involves an n-ary aggregation function F that assigns to the given fuzzy relations R 1 , · · · , R n a new fuzzy relation R F = F(R 1 , · · · , R n ), called an aggregated fuzzy relation. Aggregation functions on products of lattices/posets and m-polar fuzzy relations have been also studied in [26,27], where the aggregating over a profile (R 1 , · · · , R n ) of m-polar fuzzy relations by aggregation function F is defined by

Generating m-Polar T-Orders from m-Polar Fuzzy Data
This section discusses a method to construct an m-polar fuzzy T-preorder, where T is a left continuous t-norm, based on an aggregation function A and then provides an m-polar fuzzy T-equivalence. Let us first recall Theorem 1 which says that, if a family of fuzzy subsets of a universe X is given, then it is always possible to derive a T-preorder on X with respect to the t-norm T as below: where the fuzzy inclusion relation I NCl T (µ, ν) = inf x∈X − → T (µ(x), ν(x)) has the fundamental role to define it. In real decision-making applications, the numbers of decision makers and decision parameters/criteria are usually finite. This means that we have mostly finite records of fuzzy information. In this case, the fuzzy T-preordering R, defined in Theorem 1, is computed by where the inf operator is replaced by the min operator that can be considered as a logic AND or conjunction belonging to a bigger class known as aggregation functions. It is, therefore, a very natural question whether the aggregating of , µ K (y) by any aggregation function A still provides a T-preordering on X or not?
Adding multi-polarity to the uni-polar scale of fuzzy sets that is known as m-polar fuzzy sets allows experts to deal with inputs from different categories or sources in decision situations. Since the two operators − → T and ← → T play a basic role to construct T-preorderings and T-equivalences on the set X, to cope with the above question in the m-polar fuzzy framework, we need first to generalize these operators to obtain an m-polar-based representation of them.
for any By adopting the properties of implication operator, discussed in [12,13], for the mpolar case, the following properties are immediately obtained for m-polar implication operation given in Definition 9.

Lemma 1.
Consider the left-continuous t-norm T and an m-polar fuzzy subset µ : X → [0, 1] m of X. For any x, y, z ∈ X and 1 ≤ s ≤ m, the following assertions hold: Proof.
Then, because of the non-decreasing and associativity of T, we have: The items 5, 6, 7, and 8 are clearly obtained based on Definition 9.

Corollary 1.
Let T be a left-continuous t-norm and µ : X → [0, 1] m be an m-polar fuzzy subset of X. Then, for any x, y, z ∈ X: Motivated by Theorem 1, the next result gives a method to generate an m-polar fuzzy T-preorder relation on X with respect to the t-norm T and the aggregation function A. This change enables us to measure the strength of fuzzy relationship between each pair of elements x and y at any direction s; 1 ≤ s ≤ m, based on all implication degrees from x to y, not necessarily the minimum one.

Theorem 3. Consider a left-continuous t-norm T and an aggregation function A such that A
T. Let X be a universal set and {µ j : 1 ≤ j ≤ K} be a finite family of m-polar fuzzy subsets of X. The m-polar fuzzy relation R : X × X → [0, 1] m such that, for any x, y ∈ X, the degree R(x, y) = (π 1 • R(x, y), · · · , π m • R(x, y)) is defined by is an m-polar T-preorder on X.
Proof. Let {µ j : 1 ≤ j ≤ K} be a finite family of m-polar fuzzy sets on X. Suppose that T is left continuous t-norm and A is an aggregation function such that A T. For any 1 ≤ j ≤ K; 1 ≤ s ≤ m and x ∈ X, the reflexivity of m-polar fuzzy relation R follows from boundary property A(1, · · · , 1) = 1 and the fact that T(1, π s • µ j (x)) ≤ π s • µ j (x). To prove T-transitivity for R, take x, y, z ∈ X and 1 ≤ s ≤ m. Then, by Lemma 1, item (3), we have since A is monotone and, for any Example 1. Let T be the t-norms T L , T P , and T M . For any x, y ∈ X and 1 ≤ s ≤ m, the following are the associated m-polar fuzzy T-preorderings generated by Equation (8): 1.
If T := T M and A := Min. Then,

Proposition 3.
Consider the left-continuous t-norms T 1 , T 2 and T; and the aggregation functions A 1 , A 2 and A such that A 1 T 1 , A 2 T 2 , and A T. For the m-polar fuzzy preorder relations R 1 , R 2 and R with respect to T 1 , T 2 and T, respectively, the following assertions hold.
The converse will be held if A is conjunction.

Theorem 4. Let T be a left continuous t-norm and A be a conjunctive aggregation function such that A
T. Consider the finite set X with cardinality K. An m-polar fuzzy relation R on X is reflexive if and only if there exists a family {µ j : 1 ≤ j ≤ K} of m-polar fuzzy subsets of X generating the m-polar fuzzy relation R by π s • R(x, y) = A j [ − → T (π s • µ j (x), π s • µ j (y))] such that R ⊆ R .
Proof. Let the left continuous t-norm T be given. Let us suppose first that the m-polar fuzzy relation R is reflexive. Take the conjunction aggregation function A T. For any x, y ∈ X and 1 ≤ s ≤ m, we have Conversely, let R, R : X × X → [0, 1] m be two m-polar fuzzy relations on X such that R ⊆ R and R is the T-preordering defined in Theorem 3 by a family {µ j : 1 ≤ j ≤ K} of m-polar fuzzy subsets of X. The reflexivity of R is implied immediately by reflexivity of R.

Theorem 5. Let T be left continuous t-norm and A be a disjunctive aggregation function such that A
T. Consider the finite set X with cardinality K. An m-polar fuzzy relation R on X is T-transitive if and only if there exists a family {µ j : 1 ≤ j ≤ K} of m-polar fuzzy subsets of X generating the m-polar fuzzy relation R by Proof. Let the m-polar fuzzy relation R be T-transitive. For any 1 ≤ s ≤ m and x, y, z ∈ X, we have T π s • R (z, x), π s • R (x, y) ≤ π s • R (z, y), thus π s • R (x, y) ≤ − → T (π s • R (z, x), π s • R (z, y)). This implies that π s • R (x, y) ≤ A z∈X [ − → T (π s • R (z, x), π s • R (z, y))] since A ≥ Max. Now, it is sufficient to put X = J = {1, 2, · · · , K} and take π s • R (z, x) = π s • µ z (x) , π s • R (z, y) = π s • µ z (y).

Proposition 4.
Consider conjunction A and t-norm T, both of them without zero divisors. The relation R defined in Theorem 3 by the family {µ j : 1 ≤ j ≤ K} of m-polar fuzzy sets is m-polar T-antisymmetric if and only if for any 1 ≤ s ≤ m there exists µ i such that, for any x, y ∈ X, either π s • µ i (x) = 0 or π s • µ i (y) = 0, but not both.

Remark 1.
Note that, under the conditions of Proposition 4, the property of T-antisymmetry is equivalent to A-antisymmetry and min-antisymmetry. Theorem 6. Let R be the m-polar fuzzy T-preordering on X defined in Theorem 3. Then, the aggregated fuzzy relation R F over the components of R, where R F (x, y) = F(π 1 • R(x, y), · · · , π m • R(x, y)) for any x, y ∈ X, by the aggregation function F is a fuzzy T-preorder on X if F T.
Clearly, if R is an m-polar fuzzy T-preordering on X w.r.t aggregation function A, as defined in Theorem 3, then R A is a fuzzy T-preorder on X. In particular, if T := T M , then the aggregation functions A and F must be the minimum operator where the aggregated fuzzy relation R min defined by

m-Polar T-Equivalences
In literature, there exists a fundamental representation theorem for T-equivalences with respect to left-continuous t-norms (c.f. Theorem 2), which shows that such relations can be generated from families of fuzzy sets by means of biimplications (see also Proposition 2, items 3, 4, and 6). This section is dedicated to developing an analogous result for constructing m-polar fuzzy equivalences by means of B-composition of m-polar fuzzy T-preorders introduced in Theorem 3, where B is an aggregation function.

Theorem 7. Consider the left-continuous t-norm T and aggregation function A
T. Let X be a universal set and {µ j : 1 ≤ j ≤ K} be a finite family of m-polar fuzzy subsets of X generating the m-polar T-preorder relation R w.r.t A. If B is a symmetric aggregation function such that B T, then an m-polar fuzzy relation E : X × X → [0, 1] m defined by E(x, y) = (π 1 • E(x, y), · · · , π m • E(x, y)) for any x, y ∈ X such that, for each 1 ≤ s ≤ m, is an m-polar T-equivalence relation on X.
Proof. m-polar fuzzy reflexivity and symmetry of E are clear. The m-polar fuzzy Ttransitivity is followed from T-transitivity of m-polar fuzzy relation R. Take x, y, z ∈ X and 1 ≤ s ≤ m, then Example 2. Let T be the t-norms T L , T P , and T M . For any x, y ∈ X and 1 ≤ s ≤ m, the following are the associated m-polar fuzzy T-equivalences generated by Equation (9): 1.
If T := T M and A, B := Min. Then,

Proposition 5.
Consider the left-continuous t-norms T 1 , T 2 and T; and the aggregation functions A 1 , A 2 , A and symmetric ones B 1 , B 2 , B such that A 1 , B 1 T 1 , A 2 , B 2 T 2 and A, B T. For the m-polar fuzzy equivalences E 1 , E 2 and E with respect to T 1 , A 1 , B 1 ; T 2 , A 2 , B 2 ; and T, A, B, respectively, the following assertions hold.

The converse holds if B is a conjunction.
Proof. It is obtained easily by Theorem 7 and Proposition 3.

Theorem 8. Suppose T be a left-continuous t-norm.
Consider the m-polar fuzzy T-equivalence E w.r.t B. Then, the aggregated fuzzy relation E F by an aggregation function F where E F (x, y) = F(π 1 • E(x, y), · · · , π m • E(x, y)) for any x, y ∈ X is a fuzzy T-equivalence on X.
Proof. Analogous to the proof of Theorem 6.
Theorem 9. The m-polar fuzzy relation R given in Theorem 3 is a T-E-ordering where E is the T-equivalence relation defined by Equation (9) and B is a conjunction with the neutral element e = 1.

Proof.
Trivially, R is supposed to be T-transitive by Theorem 3. For any 1 ≤ s ≤ m, we have π s • E(x, y) = B(π s • R(x, y), π s • R(y, x)) ≤ π s • R(x, y) since B is conjunction. This means that R is an m-polar E-reflexive relation. To prove T-E-antisymmetry of R, we first show that B T implies B ≥ T by putting x = y = 1 in the following inequality T(B(u, y), B(x, v)) ≤ B(T(u, x), T(y, v)) : x, y, u, v ∈ [0, 1]. Then, it is immediately seen that R is an m-polar T-E-antisymmetry. Thus, R is an m-polar T-E-ordering.

Constructing Crisp Orderings of the m-Polar T-Orderings
In decision sciences, the problem of ranking, dealing with definitions of preorder, and preference relations on the set of alternatives is the main task. Decision makers define a preorder (called partial ranking), which is a reflexive and transitive binary relation, or, in an ideal case, a total preorder (known as complete ranking) that is a complete transitive binary relation, on the set of alternatives/objects in order to compare the preference of objects and then choose the optimum one.
Dealing with m-polar fuzzy data, the first step is to derive a crisp preorder based on the m-polar fuzzy relation (called Defuzzification step) and then to develop a preference relation of alternatives. In this section, we provide a crisp ordering over X by using the mpolar fuzzy T-preorder relation R and the m-polar fuzzy T-equivalence relation E defined in the previous section.
It is easy to check that, for the m-polar fuzzy T-preordering R and the m-polar fuzzy T-equivalence E, the crisp relations " s R " and "∼ s R " on X given by and π s • E(x, y) = 1 ⇐⇒ x∼ s R y (11) where s = 1, · · · , m; are considered as preorder and equivalence relations, respectively. Moreover, if x s R y and y s R x, then π s • R(x, y) = 1 and π s • R(y, x) = 1 that implies x∼ s R y meaning that s R is a preference relation on X compatible with equivalence ∼ s R . Note also that the intersection relation R = m s=1 s R is a preorder relation on X compatible with equivalence ∼ R = m s=1 ∼ s R . However, the condition of equality to 1 makes the derived relations s R and ∼ s R too strong. In many real-world examples, there exists a certain tolerance for computing the m-polar fuzzy relations. For example, π s • R(x, y) = 0.95 can be considered as almost 1 which means the relation x s R y may be also taken into account for such case. Motivated by Equations (10) and (11) and using the concept of a-cut for m-polar fuzzy set, where a = (a 1 , · · · , a m ) ∈ [0, 1] m , a way to define crisp relations on X, known as a-cut relations, associated with the values a s ∈ [0, 1] where 1 ≤ s ≤ m, is considered as below.
Theorem 10. Let a = (a 1 , · · · , a m ) ∈ [0, 1] m be a given m-tuple threshold vector. Consider the m-polar T-preordering R w.r.t A and the m-polar T-equivalence E w.r.t B over the X. The crisp relation " s,a R " on X defined by is a preference relation compatible with equivalence relation "∼ s,a R ", where x∼ s,a R y ⇐⇒ π s • E(x, y) ≥ a s : a s ∈ (0, 1]; if and only if T := T M .
Proof. It is clear since the only continuous idempotent t-norm T is T M .
The following results are obtained easily from Theorem 10. Proposition 6. Let T 1 and T 2 be some left-continuous t-norms. Consider the m-polar T 1 -preordering R 1 and T 2 -preordering R 2 w.r.t A 1 and A 2 and the m-polar T 1 -equivalence E 1 and T 2 -equivalence E 2 w.r.t B 1 and B 2 , respectively. Suppose that R is the m-polar T M -preordering and b = (b 1 , · · · , b m ) and c = (c 1 , · · · , c m ) are the given m-tuple threshold vectors. For any 1 ≤ s ≤ m, the following hold. 1. If Proof. It is straightforward.
Theorem 11. Suppose that the m-tuple threshold vector a = (a 1 , · · · , a m ) ∈ [0, 1] m is given such that for some 1 ≤ s ≤ m; a s = b. Let T be a left-continuous t-norm and F be an aggregation function. Consider the m-polar T-preordering R w.r.t A and the m-polar T-equivalence E w.r.t B. Then, the following assertions hold. Let F be a conjunction. If min(π 1 • R(x, y), · · · , π m • R(x, y)) = b * , then x b * R F y. Similarly, if min(π 1 • E(x, y), · · · , π m • E(x, y)) = c * , then x∼ c * R F y.
Proof. It is straightforward.

Application in Decision-Making
Since the m-polar T-preorder R, given in the previous section, is not always complete (i.e., the equality max(π s • R(x, y), π s • R(y, x)) = 1 is not necessarily true for all x, y ∈ X and any 1 ≤ s ≤ m), the results from the previous section do not necessarily define a complete or linear ranking over the alternatives. One way to provide a complete ranking, associated with the m-polar T-preorder relation R, is to use the score functions. When we deal with multi-polar data, two procedures may be offered to obtain a ranking of alternatives: (I) aggregating first (using Theorems 6 and 8) and then ranking with the help of score function, and (II) aggregating and ranking at once.
If the first way is used, we start with deriving the aggregated fuzzy relation R F of the profile (π 1 • R, · · · , π m • R) based on an aggregation function F. After that, by using the crisp preorderings R F or b R F , the score functions S(., R F ) : for any y ∈ X can be applied to obtain the rank of given objects (as proposed in Theorem 12). The idea behind these rules is based on the entering and leaving flows to each alternative in the crisp directed graphs (X, R F ) or (X, b R F ), respectively.

Theorem 12.
Consider the crisp relations R F and b R F on X. 1.
The score function S(., R F ) provides a complete preference relation on X as 2.
The score function S(., b R F ) provides a complete preference relation on X defined by In Algorithm 1, we apply the proposed procedure for solving the problem of ranking in group decision-making with m-polar fuzzy inputs.

Remark 2.
In order to rank alternatives based on the m-polar fuzzy T-orderings, Algorithm 1 starts with computing the value of fuzzy relation π s • R(x i , x j ) for 1 ≤ s ≤ m and any x i , x j ∈ X which shows the strength of the relationship between x i and x j at direction s. By repeating this loop for s = 1, 2, 3, · · · , m, a list of fuzzy relations π 1 • R, π 2 • R, · · · , π m • R is provided. This helps us to construct the m-polar fuzzy relation R = (π 1 • R, π 2 • R, · · · , π m • R). Then, at Step 2, the aggregated matrix R F is derived by applying the given aggregation function F on the profile R = (π 1 • R, π 2 • R, · · · , π m • R). Each entry R Fij of matrix R F shows the consensus fuzzy relation between x i and x j . This information is then converted to the preference matrix P(R F ) = [p ij ] n×n in Step 3 to provide comparison results over the set of candidates. Finally, in Steps 4 and 5, the score of each alternative is calculated to rank candidates from the best to the worst and find the optimum choice.
Left-continuous t-norm T. Aggregation functions A T (for constructing T-preordering) and F T (for computing aggregated relation). Threshold value b ∈ [0, 1] (if T is the minimum operator). Output : Optimum solution. begin Step 1. for s = 1, 2, . . . , m do for i = 1, 2, . . . , n do for j = 1, 2, . . . , n do Compute the fuzzy relation π s • R(x i , x j ) by Equation (8). end end end Step 2. for i = 1, 2, . . . , n do for j = 1, 2, . . . , n do Using Theorem 6 to derive the aggregated relation Step 3. Utilize Equation (10) (or Equation (12)) for relation R F to construct an n × n preference matrix P( Step 4. for i = 1, 2, . . . , n do Calculate the score value S(x i , R F ) (or the score value S(x i , b R F )) based on the resultant matrix from Step 3 and Equation (13) (or Equation (14)). end Step 5. Rank the alternatives x i based on (S) and then select the best one(s) (see Theorem 12). end Theorem 13. Consider the m-polar T-preordering relation R on X. The score function S(., R) provides a complete preference relation on X as Algorithm 2 shows how the second method can solve the ranking problem in m-polar fuzzy group decision-making.

Illustrative Example
In any trip, the problem of accommodation is one of the most important issues. The best option is always selected after comparing different residences based on some parameters, such as facilities and location of hotels and the guest's budget. In this section, we discuss the problem of hotel booking, which is about selecting the best hotel to stay regarding a list of criteria, to provide a real-life example which shows the application of our method in decision-making problems. We apply some data given in [28], obtained from the "www.agoda.com" website, as our input (see Table 1).

Example 3.
Let us suppose that a travel agency wants to book a four-star hotel in Kuala Lumpur, Malaysia, for a customer. Let H = {h 1 , · · · , h 10 } be a short list of ten four-star hotels in Kuala Lumpur which are selected for consideration. To choose the optimum option, these hotels are compared with each other based on the following two parameters P = {p 1 = Services and Facilities, p 2 = Food} that are the most important criteria for the customer. The comments of five guests of these hotels, which are shown by µ 1 , · · · , µ 5 , who filled up the online questioners from five different categories "Families with Young Children", "Families with Elder Children", "Couples", "Solo Travelers", and "Group of Friends" are taken into consideration as the initial evaluation of these hotels by using 2-polar fuzzy sets (see Table 1).
For t-norm T := T L and by using Equation (8) (see Theorem 3), the 2-polar T L -preordering R 1 w.r.t Min operator and the 2-polar T L -equivalence E 1 w.r.t Min operator are obtained as shown in Tables 2 and 3.
If we change the t-norm T to T M , consequently, A := F := Min, the 2-polar T M -preordering R 2 w.r.t Min operator and the 2-polar T M -equivalence E 2 w.r.t Min operator are obtained as shown in Tables 4 and 5.
By using the proposed method in Algorithm 1 for aggregation functions F := AM, the score values S(x i , R AM ) for 1 ≤ i ≤ 10 are computed as can be seen in Table 6.

Conclusions
The concept of T-orderings that is defined based on the infimum of implications depends only on the choice of t-norm T. By restricting the study to the case dealing with finite records of fuzzy information, the infimum is represented as minimum operator, belonging to the family of aggregation functions. In this case, a very natural extension is to generalize T-orderings based on any aggregation functions, such as arithmetic mean or geometric mean. This paper has considered the generalized T-preorderings and T-equivalences for m-polar fuzzy sets based on m-polar implication operators and aggregation functions. The interesting observation is the domination of an aggregation operator over the t-norm T. In contrast to literature, which usually talked about fuzzification of crisp orderings, this paper has discussed how crisp orderings can be obtained by direct defuzzification (or cut-relations) of m-polar fuzzy T-orderings. As a result, two alternative ways of ranking the m-polar fuzzy data are formulated based on new score value functions, computed by generalized m-polar T-orderings, and illustrated by a numerical example. Some other problems that may be handled in the future are a deeper analysis of the proposed m-polar T-orderings and the search for necessary and sufficient conditions for the characterization of such relations based on pre-aggregation functions.

Conflicts of Interest:
The authors declare no conflict of interest.