Skip to content
Lecture 8
 - Nash Equilibrium: Location, Segregation and Randomization episode artwork

Jun 4, 2018 1 hr 13 min

Lecture 8 - Nash Equilibrium: Location, Segregation and Randomization

from Yale Open Courses ECON 159: Game Theory Hosted by William Sheppard

We first complete our discussion of the candidate-voter model showing, in particular, that, in equilibrium, two candidates cannot be too far apart. Then we play and analyze Schelling’s location game. We discuss how segregation can occur in society even if no one desires it. We also learn that seemingly irrelevant details of a model can matter. We consider randomizations first by a central authority (such as in a bussing policy), and then decentralized randomization by the individuals themselves, “mixed strategies.” Finally, we look at rock, paper, scissors to see an example of a mixed-strategy equilibrium to a game.

Episode details come from the podcast's RSS feed.

Embed this episode

Ready to play

Lecture 8 - Nash Equilibrium: Location, Segregation and Randomization

0:00 1:13:49

No transcript yet.

Requests help us decide what to transcribe next.

Frequently asked questions

How long is this episode of Yale Open Courses ECON 159: Game Theory?

This episode is 1 hour and 13 minutes long.

When was this Yale Open Courses ECON 159: Game Theory episode published?

This episode was published on June 4, 2018.

Can I download this Yale Open Courses ECON 159: Game Theory episode?

Yes. Use the download control on the episode player to save the publisher-provided media file.