In this paper, we consider multiobjective two-person zero-sum games with vector payoffs and vector fuzzy payoffs. We translate such games into the corresponding multiobjective programming problems and introduce the pessimistic Pareto optimal solution concept by assuming that a player supposes the opponent adopts the most disadvantage strategy for the self. It is shown that any pessimistic Pareto optimal solution can be obtained on the basis of linear programming techniques even if the membership functions for the objective functions are nonlinear. Moreover, we propose interactive algorithms based on the bisection method to obtain a pessimistic compromise solution from among the set of all pessimistic Pareto optimal solutions. In order to show the efficiency of the proposed method, we illustrate interactive processes of an application to a vegetable shipment problem.
Li, D.-F. (2012) A Fast Approach to Compute Fuzzy Values of Matrix Games with Payoffs of Triangular Fuzzy Numbers. European Journal of Operational Research, 223, 421-429. http://dx.doi.org/10.1016/j.ejor.2012.06.020
Bector, C.R., Chandra, S. and Vijay, V. (2004) Duality in Linear Programming with Fuzzy Parameters and Matrix Games with Fuzzy Payoffs. Fuzzy Sets and Systems, 146, 253-269. http://dx.doi.org/10.1016/S0165-0114(03)00260-4
Nishizaki, I. and Sakawa, M. (1995) Equilibrium Solutions for Multiobjective Bimatrix Games Incorporating Fuzzy Goals. Journal of Optimization Theory and Applications, 86, 433-458. http://dx.doi.org/10.1007/BF02192089
Nishizaki, I. and Sakawa, M. (2000) Equilibrium Solutions in Multiobjective Bimatrix Games with Fuzzy Payoffs and Fuzzy Goals. Fuzzy Sets and Systems, 111, 99-116. http://dx.doi.org/10.1016/S0165-0114(98)00455-2