Lecture notes · Game Theory · Lecture 1

Introduction: Five First Lessons

Yale ECON 159 Game Theory, lecture 1, explained in plain English

Want this lecture to stick? In LessonBound you get checked practice questions for every part, can ask about anything you don't get, and can listen with your screen off. Free, no ads.

Learn this lecture free

Watch or read the original lecture: Open Yale Courses.

Part 1 · 0:00–10:00

The professor explains what game theory is, where it is used, and how the course will be run and graded.

Key ideas

Words to know

strategic situation
A situation where what happens to you depends on what other people choose to do, as well as on what you choose.
price taker
A seller who has to accept the market price and cannot set its own. Firms in perfect competition are price takers, so they do not have to worry about what rivals do.
monopolist
The only seller of a product, so it has no competitors to worry about.
median
The middle value in a list. Half of the values are above it and half are below it.

Example

Think of three car companies, Ford, GM, and Toyota. Ford cannot just decide its own prices and sales plans without thinking about what the other two will do, because their choices affect Ford's results. That is what makes the situation strategic.

3 checked practice questions for this part are in the app.

Part 2 · 10:00–20:00

Students play a simple grade-choice game in class, and the lecturer shows how to record the game in a table and asks why people chose what they did.

Key ideas

Words to know

outcome matrix
A table that lists every choice each player can make and the result for each player, all in one grid.
row player
The player whose choices are listed down the side of the table. In this game, the lecturer is the row player.
column player
The player whose choices are listed across the top of the table. In this game, the lecturer's pair is the column player.
Game Theory
The study of games, where what you should do depends on what other people choose. The lecturer says the class will play many games.

Example

Imagine two friends each secretly pick a restaurant, and each one's happiness depends on what the other picks. Writing every pair of choices and the happiness each person gets in one grid shows the whole situation at a glance, just like the outcome matrix in class.

3 checked practice questions for this part are in the app.

Part 3 · 20:00–30:00

This part explains what a game needs (payoffs that show what people care about) and introduces the idea of a strategy that is always better than another, which the lecture calls strictly dominant.

Key ideas

Words to know

payoff
The reward or result a person gets from an outcome, such as the grade they receive or how much they value it.
utility (utiles)
A number that stands for how happy or satisfied a person is with an outcome. People try to make it as high as they can.
strictly dominates
One choice always gives a better result than another choice, no matter what the other people do.
normative
About what people should do, rather than what they actually did.

Example

Imagine two shops where one always sells the same item for less, whatever the other shop does with its prices. A shopper who wants to pay the least should always pick the cheaper shop, because it is better in every case. That is the idea behind a strictly dominant choice.

3 checked practice questions for this part are in the app.

Part 4 · 30:00–40:00

This part explains why people who each make the sensible choice for themselves can still end up with a bad result for everyone, using a game called the Prisoner's Dilemma.

Key ideas

Words to know

Prisoner's Dilemma
A game where each player does better by acting selfishly, no matter what the other player does, yet both end up worse off when both act that way.
Dominated strategy
A choice that is always worse for you than another choice, no matter what the other person does. A dominant strategy is the opposite: always the best choice for you.
Pareto inefficient
An outcome where you could make someone better off without making anyone worse off. The lesson says 'suck' is a simpler word for this.
Collusion
When rivals secretly agree to work together instead of competing, for example by agreeing not to lower prices.

Example

Two roommates share a dorm room. Each would like the other to clean up, but if the other person does not clean, cleaning yourself is the worst deal. So neither cleans, and the room ends up messy for both.

3 checked practice questions for this part are in the app.

Part 5 · 40:00–50:00

This part shows that changing what players care about (their payoffs) can change the whole game and the choice they make, and it introduces the idea of a coordination problem.

Key ideas

Words to know

collude
To secretly agree with others to work together for a shared gain, usually against the rules or against other people.
payoffs
The score or reward each player gets from each possible outcome of the game. It can include feelings like guilt or pride, not just money or grades.
dominant strategy
A choice that is always better than the other choices, no matter what the other player does.
coordination problem
A game where players do best by matching their choices, but there is no obvious choice to pick, so they have to work out what the other player will do.

Example

Imagine two friends deciding where to meet for dinner. One loves pizza and the other hates it. Their choices and results depend on what each person cares about, so the same choice can feel good or bad depending on their goals, just like the payoffs in the game.

3 checked practice questions for this part are in the app.

Part 6 · 50:00–1:00:00

This part shows how to pick a move in a two-player game by working out what the other player will do, and it ends with a real-world finding that many people do not pick the 'safe' choice.

Key ideas

Words to know

dominant strategy
A choice that gives you a better result than your other choice, no matter what the other player does.
payoff
The reward or score a player gets from a particular outcome of the game.
payoff matrix
A grid or table that shows every pair of choices each player can make, along with the payoff each player gets from that pair.
best response
The choice that gives you the best result, given what you think the other player will do.

Example

Imagine you and a friend are both deciding whether to split a bill evenly or pay only for what you ordered. If your friend always pays less by choosing the same thing you do, you can predict their move by thinking about their situation, not just yours. This is the same skill of putting yourself in someone else's shoes.

3 checked practice questions for this part are in the app.

Part 7 · 1:00:00–1:08:56

The professor asks why some students choose the risky Beta option, runs a 'pick a number' game in class, and ends with five lessons from the course.

Key ideas

Words to know

one-shot game
A game played only once, so there is no chance to play again with the same person and no need to build a reputation.
multi-shot game
A game played more than once with the same people, so choices now can affect what happens later.
payoff
The reward or result a player gets from a choice in a game, such as money or points.
strictly dominated strategy
A choice that is always worse than another choice, no matter what the other players do. The lesson says not to play one.

Example

Think of a tug-of-war between friends who each want to be the strongest. If you guess what the others will do and pull in the wrong direction, you can lose even if you are smart. Game theory asks you to think about what others will do before you choose.

3 checked practice questions for this part are in the app.

Notes written by AI (Claude) from the lecture's official transcript, so check anything important against the lecture. Open Yale Courses · CC BY-NC-SA 3.0 · not affiliated with or endorsed by Yale. These notes are shared under the same license.

LessonBound · Free lecture notes · Privacy · Terms · New York