A Program for Finding Nash Equilibria
We describe two-person simultaneous play games. First, we use a zero sum game to illustrate minimax, dominant and best response strategies. We illustrate Nash Equilbria in the Prisoner's Dilemma and the Battle of the Sexes Game, and distinguish three types of Nash Equilibria: a pure strategy, a mixed strategy, and a continuum (partially) mixed strategy. Then we introduce the program, Nash.m and use it to solve the games. We display the full code of Nash.m, and finally we discuss the performance characteristics of Nash.m.
|Date of creation:|
|Date of revision:|
|Contact details of provider:|| Postal: |
Web page: http://www.econ.umn.edu/
More information through EDIRC
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- John C. Harsanyi & Reinhard Selten, 1988. "A General Theory of Equilibrium Selection in Games," MIT Press Books, The MIT Press, edition 1, volume 1, number 0262582384, June.
When requesting a correction, please mention this item's handle: RePEc:wop:minnec:_004. 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: (Thomas Krichel)
If references are entirely missing, you can add them using this form.