Fuzzy Random Bimatrix Games Based on Possibility and Necessity Measures

In this study, we formulate bimatrix games with fuzzy random payoffs, and introduce equilibrium solution concepts based on possibility and necessity measures. It is assumed that each player has linear fuzzy goals for his/her payoff. To obtain equilibrium solutions based on the possibility and necessity measures, we propose two algorithms in which quadratic programming problems are solved repeatedly until equilibrium conditions are satisfied.

A novel intuitionistic fuzzy preference relations for multiobjective goal programming problems

This paper investigates novel intuitionistic fuzzy preferences relations to determine the imprecise linguistic terms with fuzzy goals. The proposed intuitionistic fuzzy goal programming (IFGP) considers the degree of vagueness and hesitations simultaneously. Different sorts of membership functions such as linear, exponential, parabolic, and hyperbolic have been introduced to depict the linguistic importance term. The overall satisfaction level is achieved by maximizing the convex combination of each fuzzy goals and the preference relations simultaneously. To verify and validate the proposed IFGP model, a numerical example is presented with the comparative study. Further, it is also applied to a banking financial statement management system problem. The proposed IFGP approach outperforms over others. At last, the conclusion and future research direction are suggested based on the performed study.

Fuzzy Goal Programming with an Imprecise Intuitionistic Fuzzy Preference Relations

Fuzzy goal programming (FGP) is applied to solve fuzzy multi-objective optimization problems. In FGP, the weights are associated with fuzzy goals for the preference among them. However, the hierarchy within the fuzzy goals depends on several uncertain criteria, decided by experts, so the preference relations are not always easy to associate with weight. Therefore, the preference relations are provided by the decision-makers in terms of linguistic relationships, i.e., goal A is slightly or moderately or significantly more important than goal B. Due to the vagueness and ambiguity associated with the linguistic preference relations, intuitionistic fuzzy sets (IFSs) are most efficient and suitable to handle them. Thus, in this paper, a new fuzzy goal programming with intuitionistic fuzzy preference relations (FGP-IFPR) approach is proposed. In the proposed FGP-IFPR model, an achievement function has been developed via the convex combination of the sum of individual grades of fuzzy objectives and amount of the score function of IFPRs among the fuzzy goals. As an extension, we presented the linear and non-linear, namely, exponential and hyperbolic functions for the intuitionistic fuzzy preference relations (IFPRs). A study has been made to compare and analyze the three FGP-IFPR models with intuitionistic fuzzy linear, exponential, and hyperbolic membership and non-membership functions. For solving all three FGP-IFPR models, the solution approach is developed that established the corresponding crisp formulations, and the optimal solution are obtained. The validations of the proposed FGP-IFPR models have been presented with an experimental investigation of a numerical problem and a banking financial statement problem. A newly developed distance measure is applied to compare the efficiency of proposed models. The minimum value of the distance function represents a better and efficient model. Finally, it has been found that for the first illustrative problem considered, the exponential FGP-IFPR model performs best, whereas for the second problem, the hyperbolic FGP-IFPR model performs best and the linear FGP-IFPR model shows worst in both cases.

Resolving Indeterminacy Approach to Solve Multi-Criteria Zero-Sum Matrix Games with Intuitionistic Fuzzy Goals

The intuitionistic fuzzy set (IFS) is applied in various decision-making problems to express vagueness and showed great success in realizing the day-to-day problems. The principal aim of this article is to develop an approach for solving multi-criteria matrix game with intuitionistic fuzzy (I-fuzzy) goals. The proposed approach introduces the indeterminacy resolving functions of I-fuzzy numbers and discusses the I-fuzzy inequalities concept. Then, an effective algorithm based on the indeterminacy resolving algorithm is developed to obtain Pareto optimal security strategies for both players through solving a pair of multi-objective linear programming problems constructed from two auxiliary I-fuzzy programming problems. It is shown that this multi-criteria matrix game with I-fuzzy goals is an extension of the multi-criteria matrix game with fuzzy goals. Moreover, two numerical simulations are conducted to demonstrate the applicability and implementation process of the proposed algorithm. Finally, the achieved numerical results are compared with the existing algorithms to show the advantages of our algorithm.