Read 1 of 5
What makes a game
How do we describe a situation in which your best move depends on what someone else does?
Think back to the monopoly setting a uniform price. It faced its customers' demand and no rival, so the only question was which price maximizes profits. That is an individual decision problem. Now suppose a second firm sold the same product. The product is homogeneous, so customers would look for the lowest price in the market. The problem would be quite different. The best price for each firm would depend on the price the other charges, so each would need to figure out the other's move, knowing the other is doing the same.
This reading gives us the language for problems like the second one. First, we separate a decision you make on your own from one whose outcome depends on what others choose. Then we set out the elements we need to describe a game.
1.1
Individual decision problem vs multi-person decision problem
In an individual decision problem, one decision-maker chooses from a set of options to best meet their goals. There are three pieces. First, a set of feasible options: what the person can do, given what is available to them, and the rules they face. Second, a goal: a way to rank the options so each one has value to the person. Third, a choice: the person picks the feasible option they value most. The result is the outcome of that choice.
Take an investor with $10,000 to split among stocks, bonds, and a savings account. The feasible options are all the splits that add up to $10,000. The goal might be the highest expected return, or the best balance between return and risk. The investor compares the splits, picks the best one, and lives with the result. Returns are uncertain, but the uncertainty is chance. Once the investor has weighed the options, the problem is simply to choose the best one.
In a multi-person decision problem, two or more decision-makers each choose from a set of options to best meet their goals, and the outcome depends on everyone's choices. There are the same three pieces as before, one set for each person. First, a set of feasible options: what the person can do, given what is available to them, and the rules they face. Second, a goal: a way to rank the outcomes so each one has value to the person. Third, a choice: the person picks an option. What changes is that the outcome now depends on all the choices together, so you can't find your best option by looking at your own options alone. It depends on what the others choose.
Take two cafés directly across the street from each other. Each sets the price of a cup of coffee. For each café, the feasible options are the prices it is willing to charge, say $4 or $6, and the goal is the highest profit. Whether $6 is a good price for Café A depends on whether Café B charges $6 or $4, and vice versa. Each café must form a view of what the other will do, knowing the other is forming a view of its own. Unlike an investor, a café can't simply compare its options and pick the best one, because each option's value depends on a choice someone else makes.
Multi-person problems are everywhere:
- The success of a group project depends on every member's effort, not just yours.
- Whether you win a pair of loudspeakers on eBay, and what you pay, depends on everyone else's bids.
- A jury's verdict depends on the work of both the defense and the prosecution.
We will call a multi-person decision problem a , and the decision-makers are its players. The word isn't meant to make these problems sound trivial. It reflects what they share with chess or poker: each player has goals, and each has to take the other players' choices into account. In a game, the outcome depends on what all the players do. The study of games is called game theory.
1.2
What we write down
To describe a game we need five elements.
- Players. The decision-makers. A player can be a person, a firm, a government or any other party, as long as its choices have a material effect on the outcome.
- Strategies. The options available to each player. A strategy can be a single action or, as we'll see in Reading 4, a plan of actions over time.
- Outcomes. What happens for each combination of strategies, one for each player.
- Payoffs. How much each player values each outcome. A payoff is a number that represents the player's ranking of the outcomes: a higher payoff means the player prefers that outcome. Profit is the usual payoff for a firm, but a payoff can also capture anything else a player cares about, such as fairness, pride, or a rival's loss.
- Rules. Who moves when, what each player knows when it moves, and how the players' strategies determine the outcome.
Writing these down is useful in itself, because it turns a hunch into a problem you can discuss. Two managers who disagree about a pricing decision often disagree about something they haven't said aloud: what the rival will do. One assumes the rival will match a price cut, the other assumes it won't, and they argue about price when the real dispute is about the rival. Setting out the game puts that assumption on the table, where the team can question it, test it, and agree on it before committing to a price.
1.3
Two cafés
Let's describe this game with the same five elements.
- Players. The two cafés, Café A and Café B.
- Strategies. Each café can charge $4 or $6 a cup. Each chooses one price without knowing what the other chooses, so the choices are simultaneous.
- Outcomes. Two players with two strategies each give four possible outcomes. There are 100 customers a day, each buying one cup, and they are very sensitive to price: they go to the cheaper café, and split evenly if the prices are equal.
- Both charge $6. The prices are equal, so the customers split: 50 go to each café.
- Both charge $4. The prices are equal again, so 50 customers go to each café.
- A charges $4 and B charges $6. Café A is cheaper, so all 100 customers go to A and none go to B.
- A charges $6 and B charges $4. Café B is cheaper, so all 100 customers go to B and none go to A.
- Payoffs. Costs are zero, so each café's payoff is its profit, which equals its revenue: price times customers served.
- Both charge $6. Each earns \(50\times6=300\).
- Both charge $4. Each earns \(50\times4=200\).
- A charges $4, B charges $6. A earns \(100\times4=400\) and B earns \(0\times6=0\).
- A charges $6, B charges $4. A earns \(0\times6=0\) and B earns \(100\times4=400\).
- Rules. Both cafés set their prices at the same time, and the customers' behavior determines how many each café serves.
A with two players and a few strategies each is easiest to read as a payoff matrix:
Read it like this. Café A chooses a row and Café B chooses a column. Each cell is one outcome, and it lists two payoffs: Café A's first, in red, and Café B's second, in blue. If Café A charges $6 and Café B charges $4, we're in the top-right cell: Café A earns 0 and Café B earns 400. The row player's payoff always comes first. It's a convention worth holding onto, because nothing else in the matrix tells you which number is whose.
1.4
Simultaneous and sequential games
The rules include the timing of the moves, and there are two broad kinds of game.
In a , each player chooses without knowing what the others have chosen. The players don't have to move at the same moment. Suppose Café B sets its price at 7 am and Café A sets its price at 8 am. If Café A can't see Café B's price before it decides, the game is still simultaneous. What matters is whether a player knows the others' choices when it makes its own.
Recall the first-price sealed-bid auction from Week 1. Each bidder submits one bid in secret, without seeing anyone else's. The bids are opened together, the highest bidder wins, and the winner pays what they bid. This is a simultaneous game. When you choose your bid, you don't know what the others bid.
In a , players move in turn, and a later player sees the earlier moves before choosing. An English auction, where every bidder sees the current high bid, is a sequential game. So is a market entry decision, where the incumbent reacts after the entrant has moved. We draw sequential games as trees, and Reading 4 treats them.
A matrix can be larger than two by two. In the game below, Alice has four actions, \(w\), \(x\), \(y\) and \(z\), and Bob has five, \(a\) to \(e\). An action profile lists one action for each player, such as \((x,d)\). Its payoffs are written \(\pi_A(x,d)=1\) for Alice and \(\pi_B(x,d)=-2\) for Bob.
Time plays no role here. The players choose once, receive their payoffs and the game is over.
Summary