Bi-matrix Games with Fuzzy Goals and Fuzzy Pay-offs

摘要

A bi-matrix game with fuzzy goal is shown to be equivalent to a (crisp) non-linear programming problem in which the objective as well as all constraint functions are linear except two constraint functions, which are quadratic, This equivalence is further extended to bi-matrix games with fuzzy pay-offs, as well as to bi-matrix games with fuzzy goals and fuzzy payoffs, whose equilibrium strategies are conceptualized by employing a suitable ranking (defuzzification) function.