SOLVING TWO-MOVE GAMES WITH PERFECT INFORMATION

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.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Aug 11, 1958
Accession Number
AD0607009

Entities

People

  • George Bernard Dantzig

Organizations

  • RAND Corporation

Tags

DTIC Thesaurus Topics

  • Applied Mathematics
  • Computer Programming
  • Computing-Related Activities
  • Convex Programming
  • Interdisciplinary Science
  • Linear Programming
  • Mathematical Programming
  • Mathematics

Fields of Study

  • Mathematics

Readers

  • Educational Psychology
  • Operations Research