Abstract
Abstract : A new proof for the existence of a value and of good strategies for a zero-sum two-person game is given. This proof seems to have some interest because of two distinguishing traits: (a) although the theorem to be proved is of an algebraical nature, a very simple proof obtains by analytical means; and (b) the proof is constructive in a sense that lends itself to utilization when actually computing the solutions of specific games. The procedure could be mechanized with relative ease, both for digital and for analogy methods. In the latter case it is probably much less sensitive to the precision of the equipment, than the somewhat related problem of linear equation solving or matrix inversion.
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.
