An algorithm for solution of interval games

A new method of solution of a two person interval game without saddle point is proposed and treated in this paper. The solution is obtained by using multisection technique, whose concept is the multiple bi‐section technique and the basis is the inequality relation of interval numbers. On the basis of multisection technique, max min and min max algorithm is given. An algorithm has been given and a numerical example is provided to illustrate the methodology.