Abstract
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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
