|
|
Heuristic Solutions For Interval-Valued Games
|
|
|
|
|
نویسنده
|
Gupta R.K. ,Khan D.
|
منبع
|
Iranian Journal Of Numerical Analysis And Optimization - 2022 - دوره : 12 - شماره : 1 - صفحه:187 -200
|
|
|
چکیده
|
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 a certain amount of ambiguity associated with them. in this work, we have developed a heuristic technique to solve two persons 𝑚 × 𝑛 zero-sum games (𝑚 > 2, 𝑛 > 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 genetic algorithm with interval fitness function, tournament selection, uniform crossover, and uniform mutation has been developed. finally, our proposed technique hasbeen demonstrated with a few examples and sensitivity analyses with respect to the genetic algorithm parameters have been done graphically to study the stability of our algorithm.
|
کلیدواژه
|
Two Persons Zero Sum Game ,Interval-Valued Payoffs ,Genetic Algorithm ,Order Relations
|
آدرس
|
West Bengal State University, Department Of Commerce And Management, India, Burdwan Raj College, Department Of Business Administration, India
|
پست الکترونیکی
|
debdip.khan@gmail.com
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|