Heuristic solutions for interval valued games

Iranian Journal of Numerical Analysis and Optimization

مقالات آماده انتشار، پذیرفته شده، انتشار آنلاین از تاریخ 14 مهر 1400  

نوع مقاله: Research Article

شناسه دیجیتال (DOI): 10.22067/ijnao.2021.71321.1048

نویسندگان

RANJAN KUMAR GUPTA ¹؛ Debdip Khan²

¹Department of Commerce and Management, West Bengal State University, Barasat, W.B., India

²Faculty, Department of Business Administration, Burdwan Raj College, Burdwan, W.B., India

چکیده

When we design the payoff matrix of a game on the basis of the available information then rarely the information is free from impreciseness and as a result the payoffs of the payoff matrix have certain amount of ambiguity associated with them. In this work we have developed a heuristic technique to solve two persons m×n zero sum games (m>2, n>2), with interval valued payoffs and interval valued objectives. Thus the game has been formulated by representing the impreciseness of the payoffs with interval numbers. To solve the game a real coded GA with interval fitness function, tournament selection, uniform crossover and uniform mutation has been developed. Finally, our proposed technique has been demonstrated with a few examples and sensitivity analyses with respect to the GA parameters have been done graphically to study the stability of our algorithm.