We numerically solve the classical "Game of Pure Strategy" using linear programming. We notice an intricate even-odd behaviour in the results of our computations that seems to encourage odd or maximal bids.

We numerically solve the classical "Game of Pure Strategy" using linear programming. We notice an intricate even-odd behaviour in the results of our computations that seems to encourage odd or maximal bids.

This paper demonstrates that a class of two-person games with ratio payoff functions can be solved using equivalent primal-dual linear programming formulations. The game's solution contains specialized information which may be used to conduct the efficiency evaluation currently done by the CCR...

We apply linear and non-linear programming to find the solutions for Nash equilibriums and Nash arbitration in game theory problems. Linear programming was shown as a viable method for solving mixed strategy zero-sum games. We review this methodology and suggest a class of zero-sum game theory...