首页 | 本学科首页   官方微博 | 高级检索  
     


Solving Matrix Games with I-fuzzy Payoffs: Pareto-optimal Security Strategies Approach
Affiliation:1. University School of Basic and Applied Sciences, Guru Gobind Singh Indraprastha University, Delhi- 110078, India;2. Department of Mathematics, Indian Institute of Technology Delhi, Hauz Khas, New Delhi- 110016, India
Abstract:A recent research work of Clemente et al. [12] on Pareto-optimal security strategies (POSS) in matrix games with fuzzy payoffs is extended to I-fuzzy scenario. Besides, the membership and the non-membership functions of the I-fuzzy values for both players are obtained by employing the technique of multiobjective optimization. The presented approach provides an efficient solution to a class of I-fuzzy matrix games with piecewise linear membership and non-membership functions. This class also includes I-fuzzy matrix games with triangular and trapezoidal I-fuzzy numbers as special cases. Further, POSS approach also provides an approximate solution to I-fuzzy matrix games with payoffs as general I-fuzzy numbers.
Keywords:Fuzzy matrix game  Intuitionistic fuzzy sets  I-fuzzy payoffs  Pareto-optimal security strategies
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号