Welcome to Nashpy’s documentation!

This is a Python library used for the computation of equilibria in 2 player strategic form games.

• Tutorial: building and finding the equilibrium for a game
  • Introduction to game theory
  • Installing Nashpy
  • Creating a game
  • Calculating the utility of a pair of strategies
  • Computing Nash equilibria
  • Learning in games
• How to
  • Install Nashpy
  • Create a Normal Form Game
  • Calculate utilities
  • Check if a strategy is a best response
  • Solve with support enumeration
  • Solve with vertex enumeration
  • Solve with Lemke Howson
  • Use fictitious play
  • Use stochastic fictitious play
  • Use replicator dynamics
  • Use replicator dynamics with mutation
  • Use asymmetric replicator dynamics
  • Use Moran processes
  • Obtain fixation probabilities
  • Obtain a repeated game
  • Use Moran processes on replacement graph
  • Use Moran processes on interaction graph
• Nashpy Game Theory Text book
  • Normal Form Games
  • Strategies
  • Best responses
  • Support enumeration
  • Vertex enumeration
  • Extensive Form Games
  • Repeated Games
  • The Emergence of Cooperation
  • The Lemke Howson Algorithm
  • Degenerate games
  • Fictitious play
  • Stochastic fictitious play
  • Replicator dynamics
  • Asymmetric replicator dynamics
  • Moran Processes
• Discussion and code reference
  • John Nash
  • How does Nashpy relate to Gambit
  • Other Python Game theory libraries
  • Bibliography
  • Source files
• Contributor documentation
  • Tutorial: make a contribution to the documentation
  • How to
  • Discussion
  • Reference
• Indices and tables

Indices and tables

• Index

• Module Index

• Search Page