Game Theory Machine

Pure & mixed Nash, dominance, and more

↗ LeadAfrik

Solve any game.

Enter a payoff matrix, or start from a classic. The machine finds every pure and mixed Nash equilibrium, checks for dominant strategies, marks the Pareto-efficient outcomes, and, when the game is a dilemma, computes how patient players must be to cooperate in the long run. Everything runs in your browser. Nothing is uploaded.

Row strategies
Column strategies

Each cell is row payoff , column payoff. Higher is better for that player. Edit the labels and numbers freely.

Model a real situation with AI Gemini

Describe a strategic standoff in plain words and the AI will turn it into a payoff matrix you can solve and edit.