Existence of Equilibrium Points for Bimatrix Game with Interval Payoffs

This paper deals a bimatrix game with payoffs as closed intervals. Existence of equilibrium point of this game is discussed by using suitable interval quadratic programming problem. Further, a methodology is proposed for finding optimal strategies for each player of the game. The methodology is illustrated by numerical example.

[1]  Emrah Akyar,et al.  Brown–Robinson method for interval matrix games , 2011, Soft Comput..

[2]  J. Goodman.  Note on Existence and Uniqueness of Equilibrium Points for Concave N-Person Games , 1965 .

[3]  J. Nash.  Equilibrium Points in N-Person Games. , 1950, Proceedings of the National Academy of Sciences of the United States of America.

[4]  Dengfeng Li.  Linear programming approach to solve interval-valued matrix games , 2011 .

[5]  Ajay Kumar Bhurjee,et al.  Efficient solution of interval optimization problem , 2012, Math. Methods Oper. Res..

[6]  Chiang Kao,et al.  Matrix games with interval data , 2009, Comput. Ind. Eng..

[7]  Chenyi Hu,et al.  Studying interval valued matrix games with fuzzy logic , 2008, Soft Comput..

[8]  Milan Hladík,et al.  Interval valued bimatrix games , 2010, Kybernetika.

[9]  Jinwu Gao,et al.  Uncertain bimatrix game with applications , 2012, Fuzzy Optimization and Decision Making.