Title: An algorithm for solution of interval games

Authors: Prasun Kumar Nayak; Sibasis Bandyopadhyay; Madhumangal Pal

Addresses: Bankura Christian College, Bankura, 722 101, India ' Gourangdi R.K.S. Institution, P.O. – Panuria, Dist-Burdwan, 713315, West Bengal, India ' Department of Applied Mathematics with Oceanology and Computer Programming, Vidyasagar University, Midnapore-721 102, India

Abstract: 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.

Keywords: two person games; interval games; max min; min max; multisection technique; saddle point.

DOI: 10.1504/IJOR.2014.061772

International Journal of Operational Research, 2014 Vol.20 No.2, pp.207 - 225

Received: 17 Aug 2012
Accepted: 19 Nov 2012
Published online: 21 Jun 2014 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article