Abstract
The principal objective of this article is to develop an effective approach to solve matrix 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 optimal strategies and game 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 Ambika approach. In this approach, it is verified that any matrix game with SVTNN payoffs always has a SVTNN game value. 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.