IBM Journal of Research and Development · 1960 · 27 citations · 4 references
ComputingComputer ScienceAlgorithmsGame TheoryOptimizationAlgorithmic Game TheoryCombinatorial Game TheoryInteger ProgrammingLinear ProgrammingMatrix ComputationNash EquilibriumCombinational Equivalence CheckingComputational Game TheoryGame SolvingMatrix GamesMinimax SearchNash Equilibrium ComputationWinning Strategies
This paper presents (1) a new characterization, via linear programming, of extreme optimal strategies of a matrix game and (2) a simple direct procedure for computing them. The first pertains to the neat formulas of L. S. Shapley and R. N. Snow for a “basic solution”, and the second to the highly effective “simplex method” of G. B. Dantzig. Both are related to the author's “combinational equivalence” of matrices, the first through an optimal block-pivot transformation and the second through a suitably chosen succession of elementary pivot steps.
4
A Contribution to Von Neumann's Theory of Games
Irving Kaplansky · Annals of Mathematics · 1945 · 110 citations
Constructive proof of the Min-Max theorem
George B. Dantzig · Pacific Journal of Mathematics · 1956 · 41 citations · Full text