Tested tool guide
Tested browser tools
Checked August 16, 2026
What Game Theory Payoff Matrix does, with a checked example
A payoff pair for every combination of row and column strategies defines the game this tool analyzes. It compares unilateral alternatives to identify dominant strategies and pure-strategy Nash equilibria, then determines mixed-strategy probabilities when applicable. Payoff order matters: in a pair written as (row, column), the first value belongs to the row player and the second to the column player. Reversing those values changes the best-response comparisons and can change every reported equilibrium.
Worked example
A concrete input and expected output from the current implementation.
Input
Payoff order: (row player, column player)
Columns: Heads, Tails
Rows:
Heads: (1,-1), (-1,1)
Tails: (-1,1), (1,-1)
->
Expected output
Pure-strategy Nash equilibria: none. Dominant strategies: none for either player. Mixed-strategy Nash equilibrium: the row player chooses Heads with 50% probability and Tails with 50%; the column player does the same.
At every pure outcome, the player receiving -1 can switch strategies and receive 1. Against a 50-50 mixture, either pure strategy has expected payoff 0, so both players are indifferent and neither benefits from changing the mixture.