A Nonlinear Programming Approach to Solving Interval-Valued Intuitionistic Hesitant Noncooperative Fuzzy Matrix Games

Abstract

Initially, fuzzy sets and intuitionistic fuzzy sets were used to address real-world problems with imprecise data. Eventually, the notion of the hesitant fuzzy set was formulated to handle decision makers’ reluctance to accept asymmetric information. However, in certain scenarios, asymmetric information is gathered in terms of a possible range of acceptance and nonacceptance by players rather than specific values. Furthermore, decision makers exhibit some hesitancy regarding this information. In such a situation, all the aforementioned expansions of fuzzy sets are unable to accurately represent the scenario. The purpose of this article is to present asymmetric information situations in which the range of choices takes into account the hesitancy of players in accepting or not accepting information. To illustrate these problems, we develop matrix games that consider the payoffs of interval-valued intuitionistic hesitant fuzzy elements (IIHFEs). Dealing with these types of fuzzy programming problems requires a significant amount of effort. To solve these matrix games, we formulate two interval-valued intuitionistic hesitant fuzzy programming problems. Preserving the hesitant nature of the payoffs to determine the optimal strategies, these two problems are transformed into two nonlinear programming problems. This transformation involves using mathematical operations for IIHFEs. Here, we construct a novel aggregation operator of IIHFEs, viz., min-max operators of IIHFEs. This operator is suitable for applying the developed methodology. The cogency and applicability of the proposed methodology are verified through a numerical example based on the situation of conflict between hackers and defenders to prevent damage to cybersecurity. To validate the superiority of the proposed model along with the computed results, we provide comparisons with the existing models.