Accession Number:

AD0607009

Title:

SOLVING TWO-MOVE GAMES WITH PERFECT INFORMATION

Descriptive Note:

Corporate Author:

RAND CORP SANTA MONICA CA

Personal Author(s):

• Dantzig, George B.

Report Date:

1958-08-11

Pagination or Media Count:

7.0

Abstract:

A two-move game with perfect information was considered, such as a move and counter-move situation between two firms or economies. This led to the problem of finding a global minimum of a concave function over a convex domain and the distressing possibility of local minima at every extreme point. It was shown however that the global minimum could 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.

Descriptors:

• *GAME THEORY
• *LINEAR PROGRAMMING
• FUNCTIONS(MATHEMATICS)
• MATRICES(MATHEMATICS)
• OPERATIONS RESEARCH
• OPTIMIZATION

Subject Categories:

• Operations Research

Distribution Statement:

APPROVED FOR PUBLIC RELEASE