Introduction
The idea of cryptocurrencies has been around for a while. Digital currencies utilizing cryptography to verify transactions are referred to as cryptocurrencies. A coin that was created to be a collaborative electronic cash exchange established by Nakamoto [1]. Consequently, Bitcoin, the initial digital currency, was established in 2009. Bitcoins are digital money systems that rely on the technology of blockchain and the technique of cryptography by Natarajan [2]. A difficult activity in the online market is the purchase or sale of a cryptocurrency due to the market’s exponential changes. To address this, we need to analyze the currency exchange using the DM procedure. Making decisions involves selecting the most suitable options from a set of data. A lot of concepts have been provided by various researchers to help people select the best choice. At the start of the era, decisions were made using precise numerical datasets, but this led to inadequate findings that were more useful in actual situations. Various DM models were worked by numerous researchers in several areas of statistics, mathematics, and artificial intelligence. Trading behavior and high volatility, explained by Urquhart [3], are what attract individuals to Bitcoin. However, it was noted that no useful outcomes for predicting volatility could be found in search engines. The reaction sequence between the socio-economic indications in the cryptocurrency budget, yet, was the focus of Garcia et al. [4] research. Additionally, two beneficial feedback cycles were identified using vector auto regression. In 2020, created a model to forecast for the price of bitcoin using Chen logical technique and fuzzy time series of Markov chain. Because this method is devoid of classical assumptions, fuzzy period sequence can simulate a variety of period sequence data patterns.
The traditional idea of a set, Zadeh [5] created the fuzzy set (FS) theory. In their work on FS, Bhattacharya, and Mukherjee [6] created fuzzy relations and fuzzy groupings. Using an FS set, Yager and Filev [7], [8] created AOs fuzzy illustrations, and constructions in 1994. Demirci [9] described fuzzy functions and their basic characteristics. Intuitionist fuzzy sets (IFS) were presented by Atanassov [10] with the restriction that the sum of these two values should not be greater than one. When the sum of the membership value (MV) and non-membership value (NMV) exceeds one, IFS may not have fully satisfied this requirement. (For instance,
However, when the power is increased to
Mehnaz et al. [28] proposed Frank operational laws for T-spherical values using TCN and TCNM depending on the proposed operations. Reference [29] developed qRO fuzzy frank aggregation operators (qROFFAOs) and their application on MADM and AOs depends on the TCN and TCNM. Xia et al. [30] established intuitionistic fuzzy aggregation operators (IFAOs) depending on Archimedean TCN and TCNM and also introduced some operational laws. Silambarasan [31] proposed generalized orthopair fuzzy which depends on the Hamacher TCN and TCNM. Operational laws and their properties, Demorgan laws over complement proposed for qROFS. Reference [32] developed comprehensive geometric AOs that depend on TCN. DM method is established for the multi-criteria decision-making (MCDM) issues. Garg [33] generalized IF geometric interaction operators through Einstein TCN and TCNM on the MCDM. Yang et al. [34] Pythagorean fuzzy (PF) on Benferroni means which depend on the TCN and TCNM. Xing et al. [35] developed AOs for Pythagorean fuzzy numbers (PFN) which are based on the FTCN and FTCNM and also introduced the Choquet Frank averaging and geometric operators on the MADM technique. Khan et al. [36] introduced a theme of some fundamental operations such as qROFHS subset, qROFHS null set, qROFHS absolute set, union, intersection, and complement. We also present “AND” and “OR” operators.
The DM problem modeling detailed consideration of the traits is necessary, and we cannot simply examine or disregard any quality without looking at the other’s significance. It is essential to utilize the principle of the HSS to handle additional attributes. Given that FHSS deals with attributes and sub-attributes uncertainly and that SS only deals with attributes, HSS deals with attributes and sub-attributes. In light of the nature of sub-attributes, this is the reason why we settled on the discipline of HSS. The development of new AOs for a qROFHS environment is the primary objective of our research. We also developed an algorithm to describe situations involving several criteria for decision-making, as well as a mathematical example to demonstrate in what way the recommended method is effective in the qROFHS setting. The process of choosing and evaluating cryptocurrencies is crucial in the digital economy. More studies using MAGDM methodologies in the selection of cryptocurrencies are needed to correctly represent the ambiguity of the cryptocurrency market information in addition to that of the individual making the choice. We propose a set of operational guidelines that are dependent on the outcome method in terms of the qROFHS set. Then, we create two aggregation operators, the qROFHSFWA and qROFHSFWG, using operational ideas. Score and accuracy functions for contrasting the qROFHS set are also offered.
The qROFHSS is a particular case of the IFHSS, PFHSS, and FHSS. It is revealed by these formations. Because our suggested framework, when compared to previous research, provides additional details. It is suggested design can handle ambiguous data in making choices in a relatively straightforward manner. As a result, compared to other fuzzy frameworks, the structure of the qROFHS set is more useful. To address issues of daily living, we use a variety of attribute options in our proposed framework. Compared to the current systems, our proposed structure specifically addressed uncertainties. Section II gathers some essential components that will help in the composition of the article’s remaining section the qROFHS set, the SS, and the HSS. Section III, this section covers the score, accuracy function, qROFHS weighted average, and qROFHS weighted geometric operators for qROFHSVs. We also use created qROFHSVs to describe the fundamental characteristics of qROFHS weighted averaging and qROFHS weighted geometric AOs. In section IV, construct a numerical example. Section V concludes the study.
Preliminaries
In this section, we define fundamental definitions of SS and qROFHSS. dcltmp
Definition 1[17]:
Let °F be a universe set with characteristics set
Definition 2[21]:
Let °F be a universal set and
Definition 3[36]:
Let °F be a set with universal and that
Definition 4:
If the following holds we explain
\Delta \subseteq {\alpha ^{\prime }} .{\text {For any}}\varpi \in \Delta ,\beth \left ({\varpi }\right )\subseteq \mathrm {Z}\left ({{a^{\prime }}}\right )
Definition 5[35]:
FTCN and FTCNM are described as two real numbers \begin{align*} {F_{TCN}}\left ({a,b}\right )&=\mathop {\mathrm {log}_{t}}\left ({1+\frac {\left ({{t^{\mathcal {H}}}-1}\right ) ({t^{\mathfrak {R}}}-1)}{t-1}}\right )\\ {F_{TCNM~}}&=1-\mathop {\mathrm {log}_{t}}\left ({1+\frac {\left ({{t^{1 -\mathcal {H}}}-1}\right )\left ({{t^{1 -\mathfrak {R}}}-1}\right )}{t-1}}\right )\end{align*}
qROFHSF Aggregation Operators Based on qROFHSFWA and qROFHSFWG
This section covers the qROFHSVs score and accuracy function, in addition to the qROFHSF weighted averaging and weighted geometric operators. Additionally, we use constructed qROFHSVs to explore the fundamental characteristics of the qROFHSF weighted averaging and weighted geometric aggregation operators.
Definition 6:
The score function of qROFHSVs is stated as \begin{equation*}{\Psi _{\varpi _{ij}}}={\gamma _{\Delta \left ({{\varpi _{ij}}}\right )}^{q}}-{{\gamma ^{\prime }}_{\Delta \left ({{\varpi _{ij}}}\right )}^{q}} \tag{1}\end{equation*}
Definition 7:
The accuracy function of qROFHVs is stated as \begin{equation*}{\alpha }\left ({{\Psi _{\varpi _{ij}}}}\right )={\gamma _{\Delta \left ({{\varpi _{ij}}}\right )}^{q}}+{{\gamma ^{\prime }}_{\Delta \left ({{\varpi _{ij}}}\right )}^{q}} \tag{2}\end{equation*}
P\left ({{\Psi _{\varpi _{ij}}}}\right )>\left ({{\Psi _{\varpi _{ij}}^{\prime }}}\right );{\text {then},}{\Psi _{\varpi _{ij}}}>{\Psi _{\varpi _{ij}}^{\prime }} thenP\left ({{\Psi _{\varpi _{ij}}}}\right )=\left ({{\Psi _{\varpi _{ij}}^{\prime }}}\right ); ~{\text {If}~}{\alpha }\left ({{\Psi _{\varpi _{ij}}}}\right )>{\alpha }\left ({{\Psi _{\varpi _{ij}}^{\prime }}}\right ){,~\text {then},}{\Psi _{\varpi _{ij}}}>{\Psi _{\varpi _{ij}}^{\prime }} ~{\text {If}~}{\alpha }\left ({{\Psi _{\varpi _{ij}}}}\right )={\alpha }\left ({{\Psi _{\varpi _{ij}}^{\prime }}}\right ),~{\text {then}~}{\Psi _{\varpi _{ij}}}={\Psi _{\varpi _{ij}}^{\prime }}
Definition 8:
Let \begin{align*}qROFHSFWA&=\left ({{\Psi _{\varpi _{11 }}},{\Psi _{\varpi _{12 }}}, \cdots {\Psi _{\varpi _{nm}}}}\right ) \\ &=\mathop {\mathop {\oplus }\limits _{j=1 }}\limits ^{m}{\pi _{i}}\left ({{\mathop {\mathop {\oplus }\limits _{i=1 }}\limits ^{n}{\mu }_{i}}{\Psi _{\varpi _{ij}}}}\right )\end{align*}
Theorem 1:
Let \begin{align*}qROFHSFWA&=\left ({{\Psi _{\varpi _{11 }}},{\Psi _{\varpi _{12 }}}, \cdots {\Psi _{\varpi _{nm}}}}\right )=\mathop {\mathop {\oplus }\limits _{j=1 }}\limits ^{m}{\pi _{j}}\left ({{\mathop {\mathop {\oplus }\limits _{i=1 }}\limits ^{n}{\mu }_{i}}{\Psi _{\varpi _{ij}}}}\right ) \\ &\begin{matrix}=\left ({\begin{matrix}\displaystyle \sqrt [{q}]{1-\mathop {\mathrm {log}_{t}}\left ({1+\mathop {\prod }\limits _{i=1 }^{n}{\left ({{t^{\left ({1 -{\left ({\sqrt [{q}]{1 -\mathop {\mathrm {log}_{t}}\left ({\begin{matrix}\displaystyle 1 + \prod _{j=1 }^{m}{\left ({{t^{\left ({1 -{\gamma _{\Delta \left ({{\varpi _{k}}}\right )}^{q}}}\right )}}-1 }\right )^{\mu _{j}}}\end{matrix}}\right )}}\right )^{q}}}\right )}}-1}\right )^{\pi _{i}}}}\right )},\\ \displaystyle \mathop {\mathrm {log}_{t}}\left ({1+\left ({\mathop {\prod }\limits _{i=1 }^{n}{\left ({{t^{\left ({\mathop {\mathrm {log}_{t}}\left ({1 +\left ({\prod _{j=1 }^{m}{\left ({{t^{\gamma _{\Delta \left ({{\varpi _{k}}}\right )}^{\prime }}}-1 }\right )^{\mu _{j}}}}\right )}\right )}\right )}}-1}\right )^{\pi _{i}}}}\right )}\right )\end{matrix}}\right )\end{matrix} \tag{3}\end{align*}
Proof:
We prove this theorem by the formula as follows. First, we have \begin{align*} &\mathop {\mathop {\oplus }\limits _{r=1 }}\limits ^{m}{\mu _{j}}\left ({{\Psi _{\varpi _{ij}}}}\right ) \\ &=\left ({\begin{matrix}\displaystyle \sqrt [{q}]{1-\mathop {\mathrm {log}_{t}}\left ({1+\mathop {\prod }\limits _{j=1 }^{m}{\left ({{t^{\left ({1 -{\gamma _{\Delta \left ({{\varpi _{k}}}\right )}^{q}}}\right )}}-1}\right )^{F{\mu _{j}}}}}\right )},\\ \displaystyle \left ({\mathop {\mathrm {log}_{t}}\left ({1+\left ({\mathop {\prod }\limits _{j=1 }^{m}{\left ({{t^{\gamma _{\Delta \left ({{\varpi _{k}}}\right )}^{\prime }}}-1}\right )^{\mu _{j}}}}\right )}\right )}\right )\end{matrix}}\right )\\ &=qROFHSFWA\left ({{\Psi _{\varpi _{11 }}},{\Psi _{\varpi _{12 }}}, \cdots {\Psi _{\varpi _{nm}}}}\right )\end{align*}
Where
Theorem 2:
Let \begin{equation*}{\Psi _{\varpi _{ij}}}=\left ({\left ({{\gamma _{\Delta \left ({{\varpi _{k}}}\right )}},{\gamma _{\Delta \left ({{\varpi _{k}}}\right )}^{\prime }}}\right )}\right )={\Psi _{\varpi }}\end{equation*}
Proof:
As we know that \begin{equation*}{\Psi _{\varpi _{ij}}}=\left ({\left ({{\gamma _{\Delta \left ({{\varpi _{k}}}\right )}},{\gamma _{\Delta \left ({{\varpi _{k}}}\right )}^{\prime }}}\right )}\right )={\Psi _{\varpi }}=\left ({\left ({{\gamma _{\Delta \left ({{\varpi _{k}}}\right )}},{\gamma _{\Delta \left ({{\varpi _{k}}}\right )}^{\prime }}}\right )}\right )\end{equation*}
\begin{align*} &\hspace {-3pc}qROFHSFWA\left ({{\Psi _{\varpi _{11 }}},{\Psi _{\varpi _{12 }}}, \cdots {\Psi _{\varpi _{nm}}}}\right )\\ &=\left ({\begin{matrix}\displaystyle \sqrt [{q}]{1-\mathop {\mathrm {log}_{t}}\left ({1+\mathop {\prod }\limits _{j=1 }^{n}{\left ({{t^{\left ({1 -{\left ({\sqrt [{q}]{1 -\mathop {\mathrm {log}_{t}}\left ({1 +\prod _{i=1 }^{m}{\left ({{t^{\left ({1 -{\gamma _{\Delta \left ({{\varpi _{k}}}\right )}^{q}}}\right )}}-1 }\right )^{\mu _{i}}}}\right )}}\right )^{q}}}\right )}}-1}\right )^{\pi _{j}}}}\right )},\\ \displaystyle \mathop {\mathrm {log}_{t}}\left ({1+\left ({\mathop {\prod }\limits _{j=1 }^{n}{\left ({{t^{\left ({\mathop {\mathrm {log}_{t}}\left ({1 +\left ({\prod _{i=1 }^{m}{\left ({{t^{\gamma _{\Delta \left ({{\varpi _{k}}}\right )}^{\prime }}}-1 }\right )^{\mu _{i}}}}\right )}\right )}\right )}}-1}\right )^{\pi _{j}}}}\right )}\right )\end{matrix}}\right )\\ &=\left ({\begin{matrix}\displaystyle \sqrt [{q}]{1-\mathop {\mathrm {log}_{t}}\left ({1+\mathop {\prod }\limits _{i=1 }^{m}{\left ({{t^{\left ({1 -{\gamma _{\Delta \left ({{\varpi _{k}}}\right )}^{q}}}\right )}}-1}\right )^{\mu _{i}}}}\right )},\\ \displaystyle \left ({\mathop {\mathrm {log}_{t}}\left ({1+\left ({\mathop {\prod }\limits _{i=1 }^{m}{\left ({{t^{\gamma _{\Delta \left ({{\varpi _{k}}}\right )}^{\prime }}}-1}\right )^{\mu _{i}}}}\right )}\right )}\right )\end{matrix}}\right )\\ &=\left ({\sqrt [{q}]{1-\mathop {\mathrm {log}_{t}}\left ({1+{\left ({{t^{\left ({1 -{\gamma _{\Delta \left ({{\varpi _{k}}}\right )}^{q}}}\right )}}-1}\right )^{\mu _{i}}}}\right )},\left ({\mathop {\mathrm {log}_{t}}\left ({1+\left ({{\left ({{t^{\gamma _{\Delta \left ({{\varpi _{k}}}\right )}^{\prime }}}-1}\right )^{\mu _{i}}}}\right )}\right )}\right )}\right )\\ &=\left ({\left ({{\gamma _{\Delta \left ({{\varpi _{k}}}\right )}},{\gamma _{\Delta \left ({{\varpi _{k}}}\right )}^{\prime }}}\right )}\right )\end{align*}
Theorem 3:
Let \begin{equation*}{\chi ^{-}}{\leq }qROFHSFWA\left ({\mathfrak {I}{\mathscr {o}_{11 }}\mathfrak {,~I}{\mathscr {o}_{12 }}\mathfrak {, \cdots I}{\mathscr {o}_{nm}}}\right ){\leq }{\chi ^{+}}\end{equation*}
Proof:
Proof is skipped.
Theorem 4:
Let \begin{align*}&\hspace {-2pc}qROFHSFWA\left ({{\Psi _{\varpi _{11 }}},{\Psi _{\varpi _{12 }}}, \cdots {\Psi _{\varpi _{nm}}}}\right )\\ &\qquad \leq qROFHSFWA\left ({{\Psi _{\varpi _{11 }}},{\Psi _{\varpi _{12 }}}, \cdots {\Psi _{\varpi _{nm}}}}\right )\end{align*}
Definition 9:
To define a weighted geometric qROFHSFWG operator is \begin{align*}&qROFHSFWG\left ({{\Psi _{\varpi _{11 }}},{\Psi _{\varpi _{12 }}}, \cdots {\Psi _{\varpi _{nm}}}}\right ) \\ &\qquad \qquad \qquad \qquad =\mathop {\mathop {\otimes }\limits _{i=1 }}\limits ^{m}{\left ({\mathop {\mathop {\otimes }\limits _{j=1 }}\limits ^{n}{\left ({{\Psi _{\varpi _{ij}}}}\right )^{\mu _{j}}}}\right )^{\pi _{i}}}\end{align*}
Theorem 5:
A weighted average qROFHSFWA is expressed (4), as shown at the bottom of the next page \begin{align*}qROFSHFWG\left ({{\Psi _{\varpi _{11 }}},{\Psi _{\varpi _{12 }}}, \cdots {\Psi _{\varpi _{nm}}}}\right )&=\mathop {\mathop {\otimes }\limits _{i=1 }}\limits ^{m}{\left ({\mathop {\mathop {\otimes }\limits _{j=1 }}\limits ^{n}{\left ({{\Psi _{\varpi _{ij}}}}\right )^{\mu _{i}}}}\right )^{\pi _{j}}} \\ &\quad \times \left ({\begin{matrix}\displaystyle \mathop {\mathrm {log}_{t}}\left ({1+\left ({\mathop {\prod }\limits _{j=1 }^{n}{\left ({{t^{\left ({\mathop {\mathrm {log}_{t}}\left ({1 +\left ({\prod _{i=1 }^{m}{\left ({{t^{{\gamma ^{\prime }}_{\Delta \left ({{\varpi _{k}}}\right )}^{q}}}-1 }\right )^{\mu _{i}}}}\right )}\right )}\right )}}-1}\right )^{\pi _{j}}}}\right )}\right ),\\ \displaystyle \sqrt [{q}]{1-\mathop {\mathrm {log}_{t}}\left ({\begin{matrix}\displaystyle 1+ \displaystyle \mathop {\prod }\limits _{j=1 }^{n}{\left ({{t^{\left ({1 -{\left ({\sqrt [{q}]{1 -\mathop {\mathrm {log}_{t}}\left ({1 +\prod _{i=1 }^{m}{\left ({{t^{\left ({1 -{\gamma _{\Delta }}\left ({{\varpi _{k}}}\right )}\right )}}-1 }\right )^{u_{i}}}}\right )}}\right )^{q}}}\right )}}-1}\right )^{\pi _{j}}}\end{matrix}}\right )}\end{matrix}}\right ) \tag{4}\end{align*}
Proof:
We prove this theorem by the formula as follows. First, we have \begin{align*}&\mathop {\mathop {\otimes }\limits _{j=1 }}\limits ^{n}{\mu _{i}}\left ({{\Psi _{\varpi _{ij}}}}\right ) \\ &=\left ({\begin{matrix}\displaystyle \left ({\mathop {\mathrm {log}_{t}}\left ({1+\left ({\mathop {\prod }\limits _{i=1 }^{m}{\left ({{t^{{\gamma ^{\prime }}_{\Delta \left ({{\varpi _{k}}}\right )}^{q}}}-1}\right )^{\mu _{i}}}}\right )}\right )}\right ),\\ \displaystyle {\left ({\sqrt [{q}]{1-\mathop {\mathrm {log}_{t}}\left ({1+\mathop {\prod }\limits _{i=1 }^{m}{\left ({{t^{\left ({1 -{\gamma _{\Delta \left ({{\varpi _{k}}}\right )}}}\right )}}-1}\right )^{\mu _{i}}}}\right )}}\right )^{q}}\end{matrix}}\right )\\ &=qROFHSFWG\left ({{\Psi _{\varpi _{11 }}},{\Psi _{\varpi _{12 }}}, \cdots {\Psi _{\varpi _{nm}}}}\right )\end{align*}
Where
Theorem 6:
Let \begin{equation*}{\Psi _{\varpi _{ij}}}=\left ({\left ({{\gamma _{\Delta \left ({{\varpi _{k}}}\right )}},{\gamma _{\Delta \left ({{\varpi _{k}}}\right )}^{\prime }}}\right )}\right )={\Psi _{\varpi }}\end{equation*}
Proof:
As we know that \begin{equation*}{\Psi _{\varpi _{ij}}}=\left ({\left ({{\gamma _{\Delta \left ({{\varpi _{k}}}\right )}},{\gamma _{\Delta \left ({{\varpi _{k}}}\right )}^{\prime }}}\right )}\right )={\Psi _{\varpi }}=\left ({\left ({{\gamma _{\Delta \left ({{\varpi _{k}}}\right )}},{\gamma _{\Delta \left ({{\varpi _{k}}}\right )}^{\prime }}}\right )}\right )\end{equation*}
Then we have, as shown in the equation at the bottom of the next page. \begin{align*} &qROFHSFWA\left ({{\Psi _{\varpi _{11 }}},{\Psi _{\varpi _{12 }}}, \cdots {\Psi _{\varpi _{nm}}}}\right )\\ &=\left ({\begin{matrix}\displaystyle \mathop {\mathrm {log}_{t}}\left ({\begin{matrix}\displaystyle 1+\\ \displaystyle \left ({\mathop {\prod }\limits _{j=1 }^{n}{\left ({\begin{matrix}\displaystyle {t^{\left ({\mathop {\mathrm {log}_{t}}\left ({\begin{matrix}\displaystyle 1 +\\ \displaystyle \left ({{\prod }_{i=1 }^{m}{\left ({{t^{{\gamma ^{\prime }}_{\Delta \left ({{\varpi _{k}}}\right )}^{q}}}-1 }\right )^{\mu _{i}}}}\right )\end{matrix}}\right )}\right )}}\\ \displaystyle -1\end{matrix}}\right )^{\pi _{j}}}}\right )\end{matrix}}\right ),\\ \displaystyle \sqrt [{q}]{\begin{matrix}\displaystyle 1-\\ \displaystyle \mathop {\mathrm {log}_{t}}\left ({\begin{matrix}\displaystyle 1+\\ \displaystyle \mathop {\prod }\limits _{i=1 }^{n}{\left ({{t^{\left ({\begin{matrix}\displaystyle 1 -\\ \displaystyle {\left ({\sqrt [{q}]{\begin{matrix}\displaystyle 1 -\\ \displaystyle \mathop {\mathrm {log}_{t}}\left ({\begin{matrix}\displaystyle 1 +\\ \displaystyle {\prod }_{j=1 }^{m}{\left ({{t^{\left ({1 -{\gamma _{\Delta \left ({{\varpi _{k}}}\right )}}}\right )}}-1 }\right )^{\mu _{j}}}\end{matrix}}\right )\end{matrix}}}\right )^{q}}\end{matrix}}\right )}}-1}\right )^{\pi _{i}}}\end{matrix}}\right )\end{matrix}}\end{matrix}}\right )\\ &=\left ({\begin{matrix}\displaystyle \left ({\mathop {\mathrm {log}_{t}}\left ({1+\left ({\mathop {\prod }\limits _{i=1 }^{m}{\left ({{t^{{\gamma ^{\prime }}_{\Delta \left ({{\varpi _{k}}}\right )}^{q}}}-1}\right )^{\mu _{i}}}}\right )}\right )}\right ),\\ \displaystyle \sqrt [{q}]{1-\mathop {\mathrm {log}_{t}}\left ({1+\mathop {\prod }\limits _{i=1 }^{m}{\left ({{t^{\left ({1 -{\gamma _{\Delta \left ({{\varpi _{k}}}\right )}}}\right )}}-1}\right )^{\mu _{i}}}}\right )}\end{matrix}}\right )\\ &=\left ({\left ({\mathop {\mathrm {log}_{t}}\left ({1+\left ({{\left ({{t^{{\gamma ^{\prime }}_{\Delta \left ({{\varpi _{k}}}\right )}^{q}}}-1}\right )^{\mu _{i}}}}\right )}\right )}\right ),\sqrt [{q}]{1-\mathop {\mathrm {log}_{t}}\left ({1+{\left ({{t^{\left ({1 -{\gamma _{\Delta \left ({{\varpi _{k}}}\right )}}}\right )}}-1}\right )^{\mu _{i}}}}\right )}}\right )\\ &=\left ({{\gamma _{\Delta \left ({{\varpi _{k}}}\right )}^{\prime }},{\gamma _{\Delta \left ({{\varpi _{k}}}\right )}}}\right )\end{align*}
Theorem 7:
Let \begin{equation*} {\Psi ^{-}}{\leq }qROFHSFWG\left ({{\Psi _{\varpi _{11 }}},{\Psi _{\varpi _{12 }}}, \cdots {\Psi _{\varpi _{nm}}}}\right ){\leq }{\Psi ^{+}}\end{equation*}
Proof:
Proof is skipped.
Theorem 8:
Let \begin{align*}&\hspace {-0.5pc}qROFHSFWG\left ({{\Psi _{\varpi _{11 }}},{\Psi _{\varpi _{12 }}}, \cdots {\Psi _{\varpi _{nm}}}}\right )\\ &\qquad \qquad \qquad \leq qROFHSFWG\left ({{\Psi _{\varpi _{11 }}},{\Psi _{\varpi _{12 }}}, \cdots {\Psi _{\varpi _{nm}}}}\right )\end{align*}
MAGDM Based on qROFHSFWA and qROFHSFWG
MAGDM is a method developed to select substitutes in different situations. Now we will use our selected method under the qROFHSS environment for multi multi-attribute group decision-making process. Let
Create a decision matrix using parameter sub-attributes
Create a decision matrix depending on the expert’s evaluation of each replacement in the form of qROFHSVs.
\begin{align*} \left ({{\chi },{\pi }}\right )&={\left ({{{\Psi _{\varpi }^{\mathrm {q}}}_{ij}}}\right )_{n\times m}}\\ &=\left ({\begin{matrix}\displaystyle {{\Psi _{\varpi }^{\mathrm {q}}}_{11 }},{{\Psi _{\varpi }^{\mathrm {q}}}_{12 }}, \cdots {{\Psi _{\varpi }^{\mathrm {q}}}_{1 m}}\\ \displaystyle {{\Psi _{\varpi }^{\mathrm {q}}}_{21 }},{{\Psi _{\varpi } }_{22 }}, \cdots {{\Psi _{\varpi } }_{2 m}}\\ \displaystyle .~.~\cdots ~.\\ \displaystyle \quad ~~.\qquad \quad ~~.\qquad \qquad ~\cdots \qquad \quad ~~.\quad ~\\ \displaystyle {\Psi _{\varpi n1 }^{\mathrm {q}}},{\Psi _{\mathrm {\varpi n2 }}^{q}}, \cdots \qquad ~~{\Psi _{\varpi nm}^{q}}\\ \displaystyle \end{matrix}}\right )\end{align*} View Source\begin{align*} \left ({{\chi },{\pi }}\right )&={\left ({{{\Psi _{\varpi }^{\mathrm {q}}}_{ij}}}\right )_{n\times m}}\\ &=\left ({\begin{matrix}\displaystyle {{\Psi _{\varpi }^{\mathrm {q}}}_{11 }},{{\Psi _{\varpi }^{\mathrm {q}}}_{12 }}, \cdots {{\Psi _{\varpi }^{\mathrm {q}}}_{1 m}}\\ \displaystyle {{\Psi _{\varpi }^{\mathrm {q}}}_{21 }},{{\Psi _{\varpi } }_{22 }}, \cdots {{\Psi _{\varpi } }_{2 m}}\\ \displaystyle .~.~\cdots ~.\\ \displaystyle \quad ~~.\qquad \quad ~~.\qquad \qquad ~\cdots \qquad \quad ~~.\quad ~\\ \displaystyle {\Psi _{\varpi n1 }^{\mathrm {q}}},{\Psi _{\mathrm {\varpi n2 }}^{q}}, \cdots \qquad ~~{\Psi _{\varpi nm}^{q}}\\ \displaystyle \end{matrix}}\right )\end{align*}
Combine all of the substitutes using the developed aggregation operators, such as the Frank weighted geometric operator and Frank weighted average.
Calculate the score for each replacement.
By ranking the substitutes in descending order of score value, choose the best option.
To establish how each step of the distinctive DM approach works, we present a practical step-wise method that depends on the following scenario. We want to study the price stability of specific cryptocurrencies denoted as
As there does not exist any cost type attribute, hence we do not need to normalize the decision matrix. Hence, we start the aggregation with the help of the developed qROFHSFWA/qROFHSFWG operators. In the following, Table 5 represents the aggregated value of the information obtained from the experts in Tables 1–4 in the form of the qROFHSVs with the help of the qROFHSFWA/qROFHSFWG operators.
Table 5 represents the aggregated values of the alternatives obtained by using qROFHSFWA and qROFHSFWG operators. Note that the aggregated values obtained are again in the form of the qROFHSVs. Now, the ranking of the green suppliers of MAGDM tools is obtained by evaluating the score values. The score values and the ranking of the substitutes are provided in Table 6 as follows.
A. Effects of Parameters
Since the FTN and FTCN play a significant role in the information fusion due to the parameter
FIGURE 2 shows the ranking of the cryptocurrency MAGDM at the various values of
Geometrical representation of the effects of the results obtained from the qROFHSFWA operator.
Geometrical representation of the effects of the results obtained from the qROFHSFWG operator.
FIGURE 3 shows the ranking of the cryptocurrency MAGDM tool at the various values of
Table 8 shows the ranking of the cryptocurrency MAGDM tool at the various values of
Geometrical representation of the effects of the results obtained from the qROFHSFWA operator.
FIGURE 4 shows the ranking of the cryptocurrency MAGDM at the various values of
FIGURE 5. Shows the ranking of the cryptocurrency MAGDM tool at the various values of
Geometrical representation of the effects of the results obtained from the qROFHSFWG operator.
Conclusion
To manage different kinds of digital currencies, avoid damages, and keep exchanges online, a detailed and accurate analysis of the market for digital currencies is necessary. An examination of the cryptocurrency market showed that financial incentives are only slightly different from safety, reorganization, and claim as the most important factors for Bitcoin investment intentions. High levels of safety, regionalized applications, and rising claims in the Bitcoin market round out the list of sub-factors. Many professors and investigators started working on cryptocurrency as a result. Many academics are using FS theory and its hybrid structures to analyze the marketplace for Bitcoin because uncertainty can be found in practically all systems in the real world. This work develops a revolutionary scholarly tool that reveals factual data in a parametric way. The HSS and the qROFS are two examples of qROFHSS provided by the multi-argument functions. The qROFHSS can be aggregated using weighted mean or weighted geometric methods. The suggested operations and definitions are checked for validity and applicability using pertinent examples. Research plays a crucial role in DM processes. The primary goal of the specialists involved in this work is to use a DM method for numerous qualities and sub-attributes to invest in the Bitcoin market. We aim to develop novel methods to analyze the lite coin market utilizing decision-making problems in the future. Upcoming applications of the structure that is suggested include the Complex Proportional Assessment (COPRAS) method, the Analytic Hierarchy Process (AHP) method, VlseKriterijumska Optimizacija I Kompromisno Resenje (VIKOR) method, the TOPSIS method, and the Interactive Multi-Ariteria Decision Making (TODIM) method, which is known in Portuguese. Additionally, we would take into account how the psychological aspects of the experts’ decisions would affect the difficulty of choosing eco-friendly providers. The new approach can potentially be used in several other domains, including the choice of funding initiatives.