Optimal Solutions for Constrained Bimatrix Games with Payoffs Represented by Single-Valued Trapezoidal Neutrosophic Numbers

• Main Authors: Mohamed Gaber, Majed G. Alharbi, Abd Alwahed Dagestani, El-Saeed Ammar
• Format: Article
• Language: English
• Published: Hindawi Limited 2021-01-01
• Series: Journal of Mathematics
• Online Access: http://dx.doi.org/10.1155/2021/5594623

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.