A Program for Finding Nash Equilibria

  • John Dickhaut
  • Todd Kaplan


We describe two-player simultaneous-play games. First, we use a zero-sum game to illustrate minimax, dominant, and best-response strategies. We illustrate Nash equilibria in the Prisoners’ Dilemma and the Battle of the Sexes Games, distinguishing among 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 sample games. We display the full code of Nash . m; finally, we discuss the performance characteristics of Nash . m.


Nash Equilibrium Mixed Strategy Pure Strategy Dominant Strategy Probability Weight 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Friedman, 1986]
    Friedman, J. W. Game Theory with Applications to Economics. Oxford University Press, New York, NY, 1986.Google Scholar
  2. [Harsanyi and Selten, 1988]
    Harsanyi, J. and R. Selten, A General Theory of Equilibrium Selection in Games. The MIT Press, Cambridge, MA, 1988.zbMATHGoogle Scholar
  3. [Nash, 1951]
    Nash, J. Non-Cooperative Games. Annals of Mathematica ,54:286–295, 1951.MathSciNetCrossRefzbMATHGoogle Scholar
  4. [Rapoport, 1970]
    Rapoport, A. Two-Person Game Theory. University of Michigan Press, Ann Arbor, Michigan, 1970.Google Scholar
  5. [von Neumann and Morgenstern, 1953]
    von Neumann, J. and O. Morgenstern, Theory of Games and Economic Behavior. Princeton University Press, Princeton, N.J., 1953.zbMATHGoogle Scholar

Copyright information

© Springer Science+Business Media New York 1993

Authors and Affiliations

  • John Dickhaut
  • Todd Kaplan

There are no affiliations available

Personalised recommendations