Constrained Bimatrix Games with Fuzzy Goals and its Application in Nuclear Negotiations

Solving constrained bimatrix games in the fuzzy environment is the aim of this research. This class of two-person nonzero-sum games is considered with finite strategies and fuzzy goals when some additional linear constraints are imposed on the strategies. We consider constrained two-person nonzero sum games with single and multiple payoffs. It is shown that an equilibrium solution of single-objective case can be characterized by solving a quadratic programming problem with linear constraints. Some mathematical program ming problems are also introduced to obtain the equilibrium points in multi objective case with crisp and fuzzy constraints. Finally, a political application of such games is presented which is about nuclear negotiations between two countries.