This section briefly describes the basic concepts of strict uncertainty and classical decision rules for making decisions in such scenarios, along with their desirable properties. Afterward, the basic concepts of fuzzy sets and their arithmetic operations are illustrated.
2.1 Strict Uncertainty and Decision Rules
Definition 1 (Strict uncertainty (Ballestero, 2002)).
A decision-making problem in strict uncertainty is characterized by:
-
1. A finite set of alternatives $\mathcal{A}=\{{a_{1}},{a_{2}},\dots ,{a_{m}}\}$.
-
2. A finite set of scenarios $\mathcal{C}=\{{r_{1}},{r_{2}},\dots ,{r_{n}}\}$.
-
3. A scalar evaluation $V:\mathcal{A}\times \mathcal{C}\to \mathbb{R}$ of each alternative for each scenario.
As a result, a decision-making problem in strict uncertainty can be summarized in a decision table as shown in Table
1.
|
Scenario |
| Alternatives |
${r_{1}}$ |
${r_{2}}$ |
$\dots $ |
${r_{j}}$ |
… |
${r_{n}}$ |
| ${a_{1}}$ |
${V_{11}}$ |
${V_{12}}$ |
$\dots $ |
${V_{1j}}$ |
$\dots $ |
${V_{1n}}$ |
| ${a_{2}}$ |
${V_{21}}$ |
${V_{22}}$ |
$\dots $ |
${V_{2j}}$ |
$\dots $ |
${V_{2n}}$ |
| … |
… |
… |
… |
… |
… |
… |
| ${a_{i}}$ |
${V_{i1}}$ |
${V_{i2}}$ |
$\dots $ |
${V_{ij}}$ |
$\dots $ |
${V_{in}}$ |
| … |
… |
… |
… |
… |
… |
… |
| ${a_{m}}$ |
${V_{m1}}$ |
${V_{m1}}$ |
$\dots $ |
${V_{m1}}$ |
$\dots $ |
${V_{mn}}$ |
The decision-making literature proposes several criteria for solving decision problems from the information in a decision table. Table
2 summarizes the most relevant decision rules under strict uncertainty, including the underlying decision-making principle followed by each rule. The Laplace score function
${L_{i}}$ (Laplace,
1825) aggregates evaluations for each alternative over the whole range of scenarios and selects the alternative with the maximum aggregated value. The Wald maximin rule (Wald,
1950) assumes that the worst scenario will occur. Then, the decision-maker focuses only on the minimum evaluation for each alternative and selects the alternative with the maximum
${W_{i}}$ over the minimum evaluations. The Hurwicz criterion (Hurwicz,
1951) is characterized by parameter
α that describes the attitude towards pessimism and optimism of a decision-maker who ultimately selects the alternative with maximum
${H_{i}}$. The Savage minimax regret criterion (Savage,
1951) requires the consideration of minimum regret
${S_{i}}$, defined as the difference between the best evaluation in the scenario and the particular evaluation of each alternative in this scenario. Finally, the Ballestero moderate pessimism rule (Ballestero,
2002) implies that the larger the range of evaluations for each scenario, the higher the distrust of the decision-maker towards the scenario. As a result, a set of weights inversely proportional to the range of evaluations for each scenario is used to adjust evaluations in score function
${B_{i}}$.
| Reference |
Principles |
Evaluation of alternatives |
Selection |
| Laplace (1825) |
Insufficient reason |
${L_{i}}={\textstyle\sum _{j=1}^{n}}{V_{ij}}$ |
${\max _{i}}{L_{i}}$ |
| Wald (1950) |
Pessimism |
${W_{i}}={\min _{j}}({V_{ij}})$ |
${\max _{i}}\hspace{0.2778em}{W_{i}}$ |
| Hurwicz (1951) |
Optimism-pessimism |
${H_{i}}=\alpha \cdot {\min _{j}}({V_{ij}})+(1-\alpha ){\max _{i}}({V_{ij}})$ |
${\max _{i}}\hspace{0.2778em}{H_{i}}$ |
| Savage (1951) |
Minimax regret |
${S_{i}}={\max _{j}}({\max _{i}}({V_{ij}})-{V_{ij}})$ |
${\min _{i}}{S_{i}}$ |
| Ballestero (2002) |
Moderate pessimism |
${B_{i}}={\textstyle\sum _{j=1}^{n}}\frac{{V_{ij}}}{{\max _{i}}({V_{ij}})-\underset{i}{\min }({V_{ij}})}$ |
${\max _{i}}\hspace{0.2778em}{B_{i}}$ |
| Hayashi (2008) |
Maximin joy |
${J_{i}}={\min _{j}}({V_{ij}}-{\min _{i}}({V_{ij}}))$ |
${\max _{i}}\hspace{0.2778em}{J_{i}}$ |
| Gaspars-Wieloch (2014) |
Dominance joy |
${D_{i}}={\textstyle\sum _{j=1}^{n}}(m-{p_{j}}({V_{ij}}))$ |
${\max _{i}}\hspace{0.2778em}{D_{i}}$ |
| Gaspars-Wieloch (2014) |
Cumulative maximin joy |
${C_{i}}={\min _{j}}(m\cdot {V_{ij}}-{\textstyle\sum _{i=1}^{m}}{V_{ij}})$ |
${\max _{i}}\hspace{0.2778em}{C_{i}}$ |
| Shestakevych and Volkov (2021) |
Extreme optimism |
${O_{i}}={\max _{j}}({V_{ij}})$ |
${\max _{i}}\hspace{0.2778em}{O_{i}}$ |
Hayashi (
2008) proposed the maximin joy criterion, as a reciprocal of the Savage minimax regret criterion. As an extension of the maximin joy criterion, Gaspars-Wieloch (
2014) introduced the dominance joy criterion and the cumulative maximin joy criterion. More recently, Shestakevych and Volkov (
2021) described the criterion of extreme optimism in which the maximum of maximum payoffs is considered to select the best alternative. Other criteria such as the Bayesian criterion, the Hermeyer criterion and the Hodge-Lehman criterion, as defined in Shestakevych and Volkov (
2021), imply the assumption of probabilities for scenarios. This assumption is out of the scope of this paper because we focus on strict uncertainty, characterized by a complete absence of knowledge concerning the probabilities associated with future states.
2.2 Fuzzy Sets and Operations
Since the pioneering work by Zadeh (
1965), the theory of fuzzy sets has been developed in several research fields. In this section, we provide a brief introduction to some basic concepts in fuzzy set theory.
Definition 2.
Let
$X\subset \mathbb{R}$ be a non-empty reference set. A fuzzy set
A is defined by its membership function
${\mu _{A}}:X\to [0,1]$. For any
$x\in X$,
${\mu _{A}}(x)$ is the degree of membership of
x in fuzzy set
A. Further,
-
• the support of A is defined as the set $\textit{supp}(A)=\{x\in X\mid {\mu _{A}}(x)\gt 0\}$;
-
• the core of A is defined as the set $\textit{core}(A)=\{x\in X\mid {\mu _{A}}(x)=1\}$;
-
• the height of A is the largest membership degree such that $h(A)={\sup _{x\in X}}{\mu _{A}}(x)$. A is said to be normal if $h(A)=1$;
-
• for $\alpha \in (0,1]$, the α-cut A is the set ${A_{\alpha }}=\{x\in X\mid {\mu _{A}}(x)=\alpha \}$.
Definition 3 (Fuzzy number).
A fuzzy set
A over the real line
$\mathbb{R}$,
${\mu _{A}}:\mathbb{R}\to [0,1]$ is said to be a fuzzy number if the following properties hold:
-
• A is normal;
-
• for any $\alpha \in (0,1]$, ${A_{\alpha }}$ is a closed interval;
-
• the $\textit{supp}(A)$ is bounded.
Within the class of fuzzy numbers, the trapezoidal fuzzy number is most commonly used to quantify fuzzy evaluation in the decision-making process. The motivation behind their utilization comes from the simplicity of these membership functions (Delgado
et al.,
1998), and their characterization requires reasonably limited information. Therefore, the definitions of the triangular and trapezoidal fuzzy numbers and operational laws (Klir and Yuan,
1995; Pedrycz
et al.,
2011), are briefly provided below.
Definition 4.
A trapezoidal fuzzy number (TrFN)
$\mathit{Tr}=(a,b,c,d)$ with four parameters
$a,b,c,d$ $(a\leqslant b\leqslant c\leqslant d)$ is a special fuzzy set on the real line
$\mathbb{R}$ and described through piecewise linear membership function
${\mu _{\mathit{Tr}}}$ as follows:
Let us denote the set of all trapezoidal fuzzy numbers on the real line $\mathbb{R}$ by $\mathcal{F}(\mathbb{R})$. The computation between the trapezoidal fuzzy numbers ${\mathit{Tr}_{1}}=({a_{1}},{b_{1}},{c_{1}},{d_{1}})$ and ${\mathit{Tr}_{2}}=({a_{2}},{b_{2}},{c_{2}},{d_{2}})$ from $\mathcal{F}(\mathbb{R})$ could be facilitated with the help of the following arithmetic operational laws:
-
• Addition: ${\mathit{Tr}_{1}}\oplus {\mathit{Tr}_{2}}=({a_{1}}+{a_{2}},{b_{1}}+{b_{2}},{c_{1}}+{c_{2}},{d_{1}}+{d_{2}})$.
-
• Subtraction: ${\mathit{Tr}_{1}}\ominus {\mathit{Tr}_{2}}=({a_{1}}-{d_{2}},{b_{1}}-{c_{2}},{c_{1}}-{b_{2}},{d_{1}}-{a_{2}})$.
-
• Scalar multiplication: $r\odot {\mathit{Tr}_{1}}=(r{a_{1}},r{b_{1}},r{c_{1}},r{d_{1}})$ for $r\gt 0$.
Note that the set of fuzzy numbers does not possess a natural order. Therefore, we require a mechanism to order or rank fuzzy numbers. Several methods have been proposed in the literature to rank or generate an order for fuzzy numbers. These methods can be classified into three main categories (Wang and Kerre,
2001; Yatsalo and Martínez,
2018):
-
1. Defuzzification-based ranking methods have been widely used in the literature for their simplicity. In such methods, fuzzy numbers are substituted for their corresponding crisp numbers, computed differently, with their subsequent ranking as in Yager (
1981) or Gu and Xuan (
2017). This class includes lexicographic methods whose order is established by an algorithm (Wang
et al.,
2005; Farhadinia,
2009).
-
2. Ranking methods based on the distance to a reference set in which a reference set is defined and each fuzzy number is evaluated by comparing its distance to the reference set. One standard method of this class for ranking fuzzy numbers is based on the fuzzy maximum function (Wang and Kerre,
2001).
-
3. Ranking methods based on pairwise comparisons aim to order fuzzy quantities by pairwise comparisons and is the most extensively explored approach. These ranking methods construct a fuzzy preference relation for pairwise comparisons among the fuzzy numbers (Yatsalo and Martínez,
2018).
Though there are various methods to produce the ordering among the fuzzy numbers, most can generate only partial order. More precisely, these methods do not warrant the anti-symmetry property of the order relation. In this paper, we focus on the ordering mechanism that generates the total order of $\mathcal{F}(\mathbb{R})$.
In this regard, Zumelzu
et al. (
2022) introduced the total order of the fuzzy numbers based on the
α-cut of the fuzzy numbers. It can overcome the drawback of defuzzification-based ranking methods. The key principle of this ordering mechanism is to compare the
α-cuts of the fuzzy numbers, which are intervals. Therefore, it is necessary to introduce the concept of total ordering of intervals.
Let
$\mathcal{I}(\mathbb{R})=\{[a,b]:(a,b)\in {\mathbb{R}^{2}},a\leqslant b\}$ be all the close and bounded sub-intervals of
$\mathbb{R}$. Consider the usual lexicographic order on the
${\mathbb{R}^{2}}$ given by
$(a,b)\geqq (c,d)\Leftrightarrow a\geqslant c\wedge b\geqslant d$. The order relation ≧ is a partial order relation on
${\mathbb{R}^{2}}$. Further, the relation ≧ induces the partial order of
$\mathcal{I}(\mathbb{R})$. We denote this partial order relation by
${\geqslant _{2}}$ and interpret it as
Bustince
et al. (
2013) introduced the notion of admissible order for intervals, which is linear and refined or encompasses a partial order.
Definition 5 (Bustince et al., 2013).
Let ≽ be a relation on
$\mathcal{I}(\mathbb{R})$. Then, the relation ≽ is said to be an admissible order relation if it satisfies:
-
• ≽ is a linear order on $\mathcal{I}(\mathbb{R})$; and
-
• for any $[a,b]$ and $[c,d]$ in $\mathcal{I}(\mathbb{R})$, $[a,b]\succcurlyeq [c,d]$ whenever $[a,b]{\geqslant _{2}}[c,d]$.
Example 1.
Some examples of the admissible order are:
-
1. $[a,b]{\succcurlyeq _{Lex1}}[c,d]\Leftrightarrow a\gt c\vee (a=c\wedge b\geqslant d)$.
-
2. Xu-Yager ordering: $[a,b]{\succcurlyeq _{XY}}[c,d]\Leftrightarrow a+b\gt c+d\vee (a+b=c+d\wedge b-a\geqslant d-c)$.
Another concept that enables us to compare two fuzzy numbers in terms of the
α-cut is the representation of fuzzy numbers using
α-cuts, specifically in terms of an upper dense sequence of
α-cuts. Let
$S={({\alpha _{i}})_{i\in \mathbb{N}}}$ be a sequence in
$[0,1]$. Then,
S is said to be an upper dense sequence if, for every
$x\in [0,1]$ and any
$\epsilon \gt 0$, there exists
$i\in \mathbb{N}$ such that
${\alpha _{i}}\in [x,x+\epsilon [$. It is noted that a fuzzy number can be represented via an upper dense sequence of
α-cuts (Wang
et al.,
2005):
Based on the admissible order relation of intervals and upper dense sequence of
α-cuts representation of fuzzy numbers, we can compare whether all
α-cuts of two fuzzy numbers are equal or there exists an
α-cut that dominates based on admissible order relation.
Definition 6 (Zumelzu et al., 2022).
Let ${\mathit{Tr}_{1}},{\mathit{Tr}_{2}}\in \mathcal{F}(\mathbb{R})$ and $S={({\alpha _{i}})_{i\in \mathbb{N}}}$ be an upper dense sequence in $(0,1]$. For an admissible order ≽ on $\mathcal{I}(\mathbb{R})$, we define an order relation ⪰ on $\mathcal{F}(\mathbb{R})$ as ${\mathit{Tr}_{1}}\succeq {\mathit{Tr}_{2}}\Leftrightarrow ({\mathit{Tr}_{1}}={\mathit{Tr}_{2}})\hspace{0.2778em}\vee \hspace{0.2778em}({\mathit{Tr}_{{1_{{\alpha _{{m_{0}}}}}}}}\succ {\mathit{Tr}_{{2_{{\alpha _{{m_{0}}}}}}}})$ where ${m_{0}}=\min \{i:{\alpha _{i}}\in S,{\mathit{Tr}_{{1_{{\alpha _{i}}}}}}\ne {\mathit{Tr}_{{2_{{\alpha _{i}}}}}}\}$ if ${\mathit{Tr}_{1}}\ne {\mathit{Tr}_{2}}$ and ${m_{0}}=0$, then ${\mathit{Tr}_{1}}={\mathit{Tr}_{2}}$.
It could be easily verified that the order relation ⪰ on $\mathcal{F}(\mathbb{R})$ induces a total order of the trapezoidal fuzzy numbers.
Note that although in Definition
6, we have mentioned that we need to consider an upper dense sequence of
α-cuts to decide the order of any two trapezoidal fuzzy numbers. However, in practice, the trapezoidal fuzzy number could be fully characterized by its support, i.e. 0-cut, and core, i.e. 1-cut. Further, the two trapezoidal fuzzy numbers would be equal only when these two
α-cuts are equal. Therefore, the condition of using an upper dense sequence of
α-cuts for ordering the trapezoidal fuzzy numbers in Definition
6 could be reduced to the condition of using only two special
α-cuts
$\bar{S}=\{0,1\}$.
Formally, two trapezoidal fuzzy numbers
${\mathit{Tr}_{1}}$ and
${\mathit{Tr}_{2}}$ are said to be equal
${\mathit{Tr}_{1}}={\mathit{Tr}_{2}}$ iff
$\textit{supp}({\mathit{Tr}_{1}})=\textit{supp}({\mathit{Tr}_{2}})$ and
$\textit{core}({\mathit{Tr}_{1}})=\textit{core}({\mathit{Tr}_{2}})$. Further, the condition for the order relation ⪰ on
$\mathcal{F}(\mathbb{R})$ could be simplified as follows:
As the order relation ⪰ on $\mathcal{F}(\mathbb{R})$ induces a total order relation, any set $\mathcal{S}\subset \mathcal{F}(\mathbb{R})$ would be total ordered.
Definition 7 (Total ordered set of fuzzy numbers).
Given set
S of fuzzy numbers,
S is a total ordered set if the following properties are satisfied:
-
1. Reflexivity. For all $\tilde{A}\in S$, $\tilde{A}\succeq \tilde{A}$.
-
2. Anti-symmetry. For all $\tilde{A},\tilde{B}\in S$, if $\tilde{A}\succeq \tilde{B}$ and $\tilde{B}\succeq \tilde{A}$, then $\tilde{A}\sim \tilde{B}$.
-
3. Transitivity. For all $\tilde{A},\tilde{B},\tilde{C}\in S$, if $\tilde{A}\succeq \tilde{B}$ and $\tilde{B}\succeq \tilde{C}$, then $\tilde{A}\succeq \tilde{C}$.
-
4. Comparability. For all $\tilde{A},\tilde{B}\in S$, $\tilde{A}\succeq \tilde{B}$ or $\tilde{B}\succeq \tilde{A}$.
Now, we utilize the ordering relation ⪰ to define the minimum and maximum operation on a set of fuzzy numbers.
Definition 8.
Let $\mathcal{O}=({\mathit{Tr}_{1}},\dots ,{\mathit{Tr}_{n}})\in \mathcal{F}{(\mathbb{R})^{n}}$. The minimum operator of fuzzy numbers with respect to the order relation ⪰ on $\mathcal{F}(\mathbb{R})$ is a mapping $\tilde{\min }:\mathcal{F}{(\mathbb{R})^{n}}\to \mathcal{F}(\mathbb{R})$ such that: $\tilde{\min }({\mathit{Tr}_{1}},\dots ,{\mathit{Tr}_{n}})={\mathit{Tr}_{k}},{\mathit{Tr}_{i}}\succeq {\mathit{Tr}_{k}}$, $\forall \hspace{0.2778em}i=1,\dots ,n$, $i\ne k$.
Definition 9.
Let $\mathcal{O}=({\mathit{Tr}_{1}},\dots ,{\mathit{Tr}_{n}})\in \mathcal{F}{(\mathbb{R})^{n}}$. The maximum operator of fuzzy numbers with respect to the order relation ⪰ on $\mathcal{F}(\mathbb{R})$ is a mapping $\tilde{\max }:\mathcal{F}{(\mathbb{R})^{n}}\to \mathcal{F}(\mathbb{R})$ such that: $\tilde{\max }({\mathit{Tr}_{1}},\dots ,{\mathit{Tr}_{n}})={\mathit{Tr}_{k}}$, ${\mathit{Tr}_{i}}\preceq {\mathit{Tr}_{k}}$, $\forall \hspace{0.2778em}i=1,\dots ,n$, $i\ne k$.
Aggregating fuzzy numbers to reach a final decision is critical in any decision-making process. Typically, the aggregation operations combine several fuzzy numbers and produce a single representative fuzzy number (Klir and Yuan,
1995). Formally, an aggregation function over trapezoidal fuzzy numbers of dimension
n can be represented as a function,
$\psi :\mathcal{F}{(\mathbb{R})^{n}}\to \mathcal{F}(\mathbb{R})$.
Definition 10.
For a set of trapezoidal fuzzy numbers $({\mathit{Tr}_{1}},\dots ,{\mathit{Tr}_{n}})\in \mathcal{F}{(\mathbb{R})^{n}}$, the weighted fuzzy arithmetic mean operator $\widetilde{\textit{WA}}:\mathcal{F}{(\mathbb{R})^{n}}\to \mathcal{F}(\mathbb{R})$ can be defined as: $\widetilde{\textit{WA}}({\mathit{Tr}_{1}},\dots ,{\mathit{Tr}_{n}})={\textstyle\bigoplus _{i=1}^{n}}({w_{i}}\odot {\mathit{Tr}_{i}})$, where $w=({w_{1}},{w_{2}},\dots ,{w_{n}})\in {[0,1]^{n}}$ such that ${w_{i}}\geqslant 0$, $i=1,\dots ,n$ and ${\textstyle\sum _{i=1}^{n}}{w_{i}}=1$. Further, if ${\mathit{Tr}_{i}}=({a_{i}},{b_{i}},{c_{i}},{d_{i}})$, $i=1,\dots ,n$, then it can be computed by utilizing the operational laws of trapezoidal fuzzy numbers and given by $\widetilde{\textit{WA}}({\mathit{Tr}_{1}},\dots ,{\mathit{Tr}_{n}})=({\textstyle\sum _{i=1}^{n}}{w_{i}}{a_{i}},{\textstyle\sum _{i=1}^{n}}{w_{i}}{b_{i}},{\textstyle\sum _{i=1}^{n}}{w_{i}}{c_{i}},{\textstyle\sum _{i=1}^{n}}{w_{i}}{d_{i}})$.