A study of a two-move game with perfect information, such as a move and countermove situation between two firms or economies. This leads to the problem of finding a global minimum of a concave function over a convex domain with the distressing possibility of local minima at every extreme point. It is shown, however, that the global minimum can be obtained by solving a linear-programming system, with side conditions that at least one of certain pairs of variables vanish. The latter problem can be shown to be equivalent to solving a linear-programming problem with some integer-valued variables.
This report is part of the RAND Corporation Paper series. The paper was a product of the RAND Corporation from 1948 to 2003 that captured speeches, memorials, and derivative research, usually prepared on authors' own time and meant to be the scholarly or scientific contribution of individual authors to their professional fields. Papers were less formal than reports and did not require rigorous peer review.
This document and trademark(s) contained herein are protected by law. This representation of RAND intellectual property is provided for noncommercial use only. Unauthorized posting of this publication online is prohibited; linking directly to this product page is encouraged. Permission is required from RAND to reproduce, or reuse in another form, any of its research documents for commercial purposes. For information on reprint and reuse permissions, please visit www.rand.org/pubs/permissions.
The RAND Corporation is a nonprofit institution that helps improve policy and decisionmaking through research and analysis. RAND's publications do not necessarily reflect the opinions of its research clients and sponsors.