Game Theory
Hey students! 🎯 Welcome to one of the most fascinating areas of mathematics - game theory! In this lesson, you'll discover how mathematics can help us understand strategic decision-making in competitive situations. We'll explore two-person zero-sum games, learn how to analyze payoff matrices, understand dominance strategies, and dive into mixed strategy solutions. By the end of this lesson, you'll be able to think like a strategic mathematician and solve real-world competitive scenarios! 🧠
What is Game Theory?
Game theory is the mathematical study of strategic decision-making between rational players. Imagine you're playing rock-paper-scissors with a friend, or two companies are competing for market share - these are all examples of games in mathematical terms! 📊
A two-person zero-sum game is a special type of game where:
- There are exactly two players
- One player's gain equals the other player's loss
- The total payoff always sums to zero
Think of it like a poker game between two people - every dollar you win is exactly one dollar your opponent loses. This makes zero-sum games particularly interesting because they represent pure competition! 💰
In the business world, consider two coffee shops on the same street. If one shop gains 20 customers, and those customers came from the other shop, then we have a zero-sum situation. The first shop gains +20 customers while the second loses -20 customers, totaling zero.
Understanding Payoff Matrices
A payoff matrix is our mathematical tool for representing a game. It's like a strategic map that shows what happens when each player chooses their strategy! 🗺️
Let's say Player I (the row player) has strategies A and B, while Player II (the column player) has strategies X and Y. Our payoff matrix might look like this:
$$\begin{pmatrix}
3 & -1 \\
2 & 4
$\end{pmatrix}$$$
Each number represents Player I's payoff. Since it's a zero-sum game, Player II's payoff is always the negative of Player I's payoff. So when Player I gets +3, Player II gets -3.
Here's how to read it, students:
- If Player I chooses strategy A and Player II chooses strategy X: Player I gets 3, Player II gets -3
- If Player I chooses strategy A and Player II chooses strategy Y: Player I gets -1, Player II gets +1
- If Player I chooses strategy B and Player II chooses strategy X: Player I gets 2, Player II gets -2
- If Player I chooses strategy B and Player II chooses strategy Y: Player I gets 4, Player II gets -4
Real-world example: Imagine two tech companies launching products. Company A (Player I) can choose to launch early (strategy A) or late (strategy B). Company B (Player II) can choose aggressive marketing (strategy X) or conservative marketing (strategy Y). The numbers represent market share gained or lost! 📱
Dominance Strategies
Sometimes, students, one strategy is clearly better than another regardless of what your opponent does. This is called dominance! 🏆
Strictly Dominant Strategy: A strategy that always gives a better payoff than another strategy, no matter what the opponent does.
Weakly Dominant Strategy: A strategy that gives at least as good a payoff as another strategy, and sometimes better.
Let's look at an example:
$$\begin{pmatrix}
5 & 2 \\
3 & 1 \\
4 & 6
$\end{pmatrix}$$$
For Player I:
- Strategy 1 gives payoffs of 5 or 2
- Strategy 2 gives payoffs of 3 or 1
- Strategy 3 gives payoffs of 4 or 6
Strategy 1 strictly dominates Strategy 2 because 5 > 3 and 2 > 1. Player I should never choose Strategy 2!
For Player II (remember, they want to minimize Player I's payoff):
- Strategy X gives Player I payoffs of 5, 3, or 4
- Strategy Y gives Player I payoffs of 2, 1, or 6
Neither column strictly dominates the other, so Player II needs to think more strategically.
In sports, think of a tennis player who has a powerful serve (Strategy 1) versus a weak serve (Strategy 2). If the powerful serve is always more effective regardless of where the opponent stands, it strictly dominates the weak serve! 🎾
Mixed Strategy Solutions
Here's where game theory gets really exciting, students! Sometimes there's no single "best" strategy, so players need to randomize their choices. This is called a mixed strategy! 🎲
A pure strategy means always choosing the same action. A mixed strategy means choosing actions randomly with specific probabilities.
Consider this classic game called "Matching Pennies":
$$\begin{pmatrix}
1 & -1 \\
-1 & 1
$\end{pmatrix}$$$
Player I wins when both players show the same side (both heads or both tails), while Player II wins when they show different sides. If Player I always chooses heads, Player II will always choose tails to win. But if both players randomize with 50% probability for each choice, neither can gain an advantage!
The Nash equilibrium in mixed strategies occurs when each player chooses their optimal probability distribution. For the matching pennies game, both players should choose each strategy with probability 0.5.
To find mixed strategy equilibria, we use the principle that at equilibrium, each player must be indifferent between their available strategies. This means:
For Player I mixing between strategies with probabilities $p$ and $(1-p)$:
Player II's expected payoff from each strategy must be equal.
For Player II mixing between strategies with probabilities $q$ and $(1-q)$:
Player I's expected payoff from each strategy must be equal.
Real-world application: In penalty kicks in soccer, the kicker and goalkeeper both use mixed strategies! Research shows that professional players kick left about 40% of the time, right about 40% of the time, and center about 20% of the time. Goalkeepers adjust their diving probabilities accordingly! ⚽
Solving Game Theory Problems
Let's work through a complete example, students! Consider this payoff matrix:
$$\begin{pmatrix}
4 & 1 \\
2 & 3
$\end{pmatrix}$$$
Step 1: Check for strictly dominant strategies
- For Player I: Neither row dominates the other
- For Player II: Neither column dominates the other
Step 2: Look for pure strategy Nash equilibrium
- If Player I chooses row 1, Player II's best response is column 2 (gives Player II -1 instead of -4)
- If Player II chooses column 2, Player I's best response is row 2 (gives Player I 3 instead of 1)
- If Player I chooses row 2, Player II's best response is column 1 (gives Player II -2 instead of -3)
- If Player II chooses column 1, Player I's best response is row 1 (gives Player I 4 instead of 2)
No pure strategy equilibrium exists!
Step 3: Find mixed strategy equilibrium
Let Player I choose row 1 with probability $p$ and row 2 with probability $(1-p)$.
Let Player II choose column 1 with probability $q$ and column 2 with probability $(1-q)$.
For Player I to be indifferent: $4q + 1(1-q) = 2q + 3(1-q)$
Solving: $4q + 1 - q = 2q + 3 - 3q$
$3q + 1 = -q + 3$
$4q = 2$
$q = 0.5$
For Player II to be indifferent: $-4p - 2(1-p) = -1p - 3(1-p)$
Solving: $-4p - 2 + 2p = -p - 3 + 3p$
$-2p - 2 = 2p - 3$
$1 = 4p$
$p = 0.25$
So the mixed strategy equilibrium is: Player I chooses row 1 with probability 0.25, Player II chooses column 1 with probability 0.5.
Conclusion
Game theory provides us with powerful mathematical tools to analyze competitive situations, students! We've learned that two-person zero-sum games can be represented using payoff matrices, where one player's gain is another's loss. Through dominance analysis, we can eliminate inferior strategies and simplify games. When no pure strategy equilibrium exists, mixed strategies allow players to randomize optimally. These concepts apply everywhere from business competition to sports strategy to evolutionary biology. The beauty of game theory lies in its ability to predict rational behavior in strategic interactions using mathematical precision! 🎯
Study Notes
• Two-person zero-sum game: Game with exactly two players where one player's gain equals the other's loss
• Payoff matrix: Mathematical representation showing outcomes for each combination of player strategies
• Strictly dominant strategy: Strategy that always performs better than another, regardless of opponent's choice
• Weakly dominant strategy: Strategy that performs at least as well as another, sometimes better
• Pure strategy: Always choosing the same action
• Mixed strategy: Randomizing between actions with specific probabilities
• Nash equilibrium: Strategic situation where no player can improve by unilaterally changing strategy
• Mixed strategy equilibrium condition: Each player must be indifferent between their available strategies
• Elimination principle: Remove strictly dominated strategies to simplify games
• Expected payoff formula: $E = \sum(\text{probability} \times \text{payoff})$ for each outcome
• Matching pennies principle: In games with no pure equilibrium, players randomize to prevent exploitation
• Minimax theorem: Every finite two-person zero-sum game has a solution in mixed strategies