Title: Teaching the applications of optimisation in game theory's zero sum and non-zero sum games

Authors: William P. Fox

Addresses: Department of Defense Analysis, Naval Postgraduate School, 589 Dyer Road, Room 103F, Monterey, CA 93943 USA

Abstract: 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 problems that are well suited for linear programming. We applied this theory of linear programming to non-zero sum games. We suggest and apply a separate formulation for a maximising linear programming problem for each player. We move on the Nash arbitration method and remodel this problem as a non-linear optimisation problem. We take the game|s payoff matrix and we form a convex polygon. Having found the status quo point (x*, y*), we maximise the product (x-x*)(y-y*) over the convex polygon using KTC non-linear optimisation techniques. The results give additional insights into game theory analysis.

Keywords: nonlinear optimisation; game theory; linear programming; Nash equilibrium; Nash arbitration; non-zero sum games; zero sum games.

DOI: 10.1504/IJDATS.2010.034059

International Journal of Data Analysis Techniques and Strategies, 2010 Vol.2 No.3, pp.258 - 284

Published online: 06 Jul 2010 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article