An algorithm for solution of interval games

Prasun Kumar Nayak, Sibasis Bandyopadhyay and Madhumangal Pal

International Journal of Operational Research, 2014, vol. 20, issue 2, 207-225

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. (search for similar items in EconPapers)
Date: 2014
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=61772 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijores:v:20:y:2014:i:2:p:207-225

Access Statistics for this article

More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().