This paper addresses the research gap in neutrosophic game theory, specifically the resolution of zero-sum two-person matrix games characterized by single-valued neutrosophic triangular numbers. We introduce a novel de-neutrosophication method leveraging Mellin’s transform to obtain crisp value indices, thereby translating neutrosophic linear programming problems into their crisp counterparts. The effectiveness and precision of our approach are demonstrated through a real-world telecom sector case study, showcasing its potential for yielding more accurate and dependable solutions.