Game Matrices
Jennifer Nordstrom · CC BY-SA 4.0 · §1.2 Game Matrices
A payoff matrix encodes a simultaneous game in a table. Player 1 picks a row, Player 2 picks a column. The cell where they meet holds both payoffs as an ordered pair: (Player 1, Player 2).
Reading a payoff matrix
Convention: rows belong to Player 1, columns to Player 2. Each cell contains a payoff vector (p1, p2). Player 1's payoff is always listed first.
Larger games
Matrices scale to any number of strategies. A 3x3 game has nine cells. The reading rule stays the same: row player picks a row, column player picks a column, read the payoff vector at the intersection.
Finding best responses in a matrix
To find Player 1's best response to a column: scan down that column and find the row with the highest P1 payoff. To find Player 2's best response to a row: scan across and find the column with the highest P2 payoff.
Notation reference
| Term | Scheme | Meaning |
|---|---|---|
| Payoff vector (a, b) | '(a b) | P1 gets a, P2 gets b |
| Row player | row index | Player 1 chooses a row |
| Column player | col index | Player 2 chooses a column |
| Best response | (p1-best-response matrix col) | Maximize your payoff given the other player's choice |
Neighbors
Prev / Next
- 🎲 Nordstrom §1.1 — players and strategies: the ingredients of a game
- 🎲 Nordstrom §1.3 — zero-sum games: your gain is my loss
- 🎲 Nordstrom §2.2 — dominated strategies: delete what is always worse
Related paper pages
- 🍞 Hedges 2018 — open games generalize payoff matrices with composition
Foundations (Wikipedia)