Abstract
The optimal strategies of any finite matrix game can be characterized by means of the Snow-Shapley Theorem [1]. However, in order to use this theorem to compute the optimal strategies, it may be necessary to invert a large number of matrices, most of which are not related to the solutions of the game. The present paper will show that when the columns of the pay-off matrix satisfy some special relations, it is possible to enumerate a much smaller class of matrices from which the optimal strategies may be obtained. Furthermore, the maximizing strategies that are determined by these matrices can be written down by inspection as soon as the matrices are specified.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
