Teaching the applications of optimisation in game theory's zero sum and non-zero sum games
Fox, William P.
MetadataShow full item record
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.
Showing items related by title, author, creator and subject.
Brown, Gerald G.; Rutemiller, Herbert (1977-10);Applications in operations research often employ models which contain linear functions. These linear functions may have some components (coefficients and variables) which are random. (For instance, linear functions in ...
Caramanis, Constantine; Dimitrov, Nedialko B. Dimitrov; Morton, David P. (2014);Discounted, discrete-time, discrete state-space, discrete action-space Markov decision rocesses (MDPs) form a classical topic in control, game theory, and learning, and as a result are widely applied, increasingly, in ...
Burgess, Nathan P.; Jordan, Keith A. (Monterey, California: Naval Postgraduate School, 2013-12);This research project is intended to determine if utility modeling could be used within the Department of Defense acquisition community. The primary effort of this research is to create a linear programming-based utility ...