Teaching the applications of optimisation in game theory's zero sum and non-zero sum games
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.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 2 (2010)
Issue (Month): 3 ()
|Contact details of provider:|| Web page: http://www.inderscience.com/browse/index.php?journalID=282|
When requesting a correction, please mention this item's handle: RePEc:ids:injdan:v:2:y:2010:i:3:p:258-284. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Darren Simpson)
If references are entirely missing, you can add them using this form.