Data frequently shows ambiguity in real life situations due to different factors. It is appropriate to represent this uncertainty by employing fuzzy sets and fuzzy numbers. Fuzzy numbers allow for flexibility by defining a membership function, making them particularly applicable in certain situations. This chapter focuses on constant sum matrix games that incorporate polygonal fuzzy numbers, which serves as a generalization of fuzzy numbers previously discussed in the literature. The objective is to deliver a constructive technique for solving constant sum matrix games with payoffs represented by n-polygonal fuzzy numbers (n-PFNs). This method ensures that the players gain-floor and loss-ceiling are expressed through a common polygonal fuzzy number (PFN)-type fuzzy value, thereby establishing that any matrix game with payoffs of n-PFNs has an n-PFNs-type fuzzy value. To solve the fuzzy matrix game, it is first transformed into a fuzzy linear programming problem, which is then reformulated into (2n + 1) separate optimization problems. These optimization problems are solved to determine the optimal value of the game. The proposed method offers advantages over other approaches as it caters to a broader range of problems. It is versatile enough to be applicable to matrix games with payoffs expressed as any polygonal fuzzy numbers namely, pentagonal fuzzy numbers, trapezoidal fuzzy numbers, triangular fuzzy numbers, interval-valued fuzzy numbers, or real numbers. Numerical illustrations, through problems arising in the varying fields of marketing and computer games, are provided to elaborate the algorithm and substantiate the stated claims.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

A Generalized Approach to Derive a Fuzzy Optimal Value of a Constant Sum Game with Payoffs as n-Polygonal Fuzzy Numbers

  • Sanjiv Kumar,
  • Ritika Chopra

摘要

Data frequently shows ambiguity in real life situations due to different factors. It is appropriate to represent this uncertainty by employing fuzzy sets and fuzzy numbers. Fuzzy numbers allow for flexibility by defining a membership function, making them particularly applicable in certain situations. This chapter focuses on constant sum matrix games that incorporate polygonal fuzzy numbers, which serves as a generalization of fuzzy numbers previously discussed in the literature. The objective is to deliver a constructive technique for solving constant sum matrix games with payoffs represented by n-polygonal fuzzy numbers (n-PFNs). This method ensures that the players gain-floor and loss-ceiling are expressed through a common polygonal fuzzy number (PFN)-type fuzzy value, thereby establishing that any matrix game with payoffs of n-PFNs has an n-PFNs-type fuzzy value. To solve the fuzzy matrix game, it is first transformed into a fuzzy linear programming problem, which is then reformulated into (2n + 1) separate optimization problems. These optimization problems are solved to determine the optimal value of the game. The proposed method offers advantages over other approaches as it caters to a broader range of problems. It is versatile enough to be applicable to matrix games with payoffs expressed as any polygonal fuzzy numbers namely, pentagonal fuzzy numbers, trapezoidal fuzzy numbers, triangular fuzzy numbers, interval-valued fuzzy numbers, or real numbers. Numerical illustrations, through problems arising in the varying fields of marketing and computer games, are provided to elaborate the algorithm and substantiate the stated claims.