How to

How to:

• Install Nashpy
• Create a Normal Form Game
• Calculate utilities
• Check if a strategy is a best response
• Handle Degenerate games
• Use the minimax theorem
• 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
• Use Introspection Dynamics