Optimal Solutions for Constrained Bimatrix Games with Payoffs Represented by Single-Valued Trapezoidal Neutrosophic Numbers
Single-valued neutrosophic set (SVNS) is considered as generalization and extension of fuzzy set, intuitionistic fuzzy set (IFS), and crisp set for expressing the imprecise, incomplete, and indeterminate information about real-life decision-oriented models. The theme of this research is to develop a...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2021-01-01
|
| Series: | Journal of Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2021/5594623 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832566432470138880 |
|---|---|
| author | Mohamed Gaber Majed G. Alharbi Abd Alwahed Dagestani El-Saeed Ammar |
| author_facet | Mohamed Gaber Majed G. Alharbi Abd Alwahed Dagestani El-Saeed Ammar |
| author_sort | Mohamed Gaber |
| collection | DOAJ |
| description | Single-valued neutrosophic set (SVNS) is considered as generalization and extension of fuzzy set, intuitionistic fuzzy set (IFS), and crisp set for expressing the imprecise, incomplete, and indeterminate information about real-life decision-oriented models. The theme of this research is to develop a solution approach to solve constrained bimatrix games with payoffs of single-valued trapezoidal neutrosophic numbers (SVTNNs). In this approach, the concepts and suitable ranking function of SVTNNs are defined. Hereby, the equilibrium optimal strategies and equilibrium values for both players can be determined by solving the parameterized mathematical programming problems, which are obtained from two novel auxiliary SVTNNs programming problems based on the proposed ranking approach of SVTNNs. Moreover, an application example is examined to verify the effectiveness and superiority of the developed algorithm. Finally, a comparison analysis between the proposed and the existing approaches is conducted to expose the advantages of our work. |
| format | Article |
| id | doaj-art-b4fb5a9650904ea49b8668248c7744e2 |
| institution | Kabale University |
| issn | 2314-4629 2314-4785 |
| language | English |
| publishDate | 2021-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Journal of Mathematics |
| spelling | doaj-art-b4fb5a9650904ea49b8668248c7744e22025-02-03T01:04:10ZengWileyJournal of Mathematics2314-46292314-47852021-01-01202110.1155/2021/55946235594623Optimal Solutions for Constrained Bimatrix Games with Payoffs Represented by Single-Valued Trapezoidal Neutrosophic NumbersMohamed Gaber0Majed G. Alharbi1Abd Alwahed Dagestani2El-Saeed Ammar3School of Mathematics and Statistics, Central South University, Changsha 410083, Hunan, ChinaDepartment of Mathematics, College of Arts and Sciences, Methnab, Qassim University, Buridah, Saudi ArabiaSchool of Business, Central South University, Changsha 410083, ChinaDepartment of Mathematics Faculty of Science, Tanta University, Tanta, EgyptSingle-valued neutrosophic set (SVNS) is considered as generalization and extension of fuzzy set, intuitionistic fuzzy set (IFS), and crisp set for expressing the imprecise, incomplete, and indeterminate information about real-life decision-oriented models. The theme of this research is to develop a solution approach to solve constrained bimatrix games with payoffs of single-valued trapezoidal neutrosophic numbers (SVTNNs). In this approach, the concepts and suitable ranking function of SVTNNs are defined. Hereby, the equilibrium optimal strategies and equilibrium values for both players can be determined by solving the parameterized mathematical programming problems, which are obtained from two novel auxiliary SVTNNs programming problems based on the proposed ranking approach of SVTNNs. Moreover, an application example is examined to verify the effectiveness and superiority of the developed algorithm. Finally, a comparison analysis between the proposed and the existing approaches is conducted to expose the advantages of our work.http://dx.doi.org/10.1155/2021/5594623 |
| spellingShingle | Mohamed Gaber Majed G. Alharbi Abd Alwahed Dagestani El-Saeed Ammar Optimal Solutions for Constrained Bimatrix Games with Payoffs Represented by Single-Valued Trapezoidal Neutrosophic Numbers Journal of Mathematics |
| title | Optimal Solutions for Constrained Bimatrix Games with Payoffs Represented by Single-Valued Trapezoidal Neutrosophic Numbers |
| title_full | Optimal Solutions for Constrained Bimatrix Games with Payoffs Represented by Single-Valued Trapezoidal Neutrosophic Numbers |
| title_fullStr | Optimal Solutions for Constrained Bimatrix Games with Payoffs Represented by Single-Valued Trapezoidal Neutrosophic Numbers |
| title_full_unstemmed | Optimal Solutions for Constrained Bimatrix Games with Payoffs Represented by Single-Valued Trapezoidal Neutrosophic Numbers |
| title_short | Optimal Solutions for Constrained Bimatrix Games with Payoffs Represented by Single-Valued Trapezoidal Neutrosophic Numbers |
| title_sort | optimal solutions for constrained bimatrix games with payoffs represented by single valued trapezoidal neutrosophic numbers |
| url | http://dx.doi.org/10.1155/2021/5594623 |
| work_keys_str_mv | AT mohamedgaber optimalsolutionsforconstrainedbimatrixgameswithpayoffsrepresentedbysinglevaluedtrapezoidalneutrosophicnumbers AT majedgalharbi optimalsolutionsforconstrainedbimatrixgameswithpayoffsrepresentedbysinglevaluedtrapezoidalneutrosophicnumbers AT abdalwaheddagestani optimalsolutionsforconstrainedbimatrixgameswithpayoffsrepresentedbysinglevaluedtrapezoidalneutrosophicnumbers AT elsaeedammar optimalsolutionsforconstrainedbimatrixgameswithpayoffsrepresentedbysinglevaluedtrapezoidalneutrosophicnumbers |