Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

Yale University

Nash Equilibrium - Location, Segregation and Randomization in Game Theory

Yale University via YouTube

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore game theory concepts in this Yale University lecture focusing on Nash equilibrium, location, segregation, and randomization. Begin with a completion of the candidate-voter model, demonstrating how equilibrium prevents candidates from being too far apart ideologically. Analyze Schelling's location game to understand how societal segregation can occur without individual desire for it. Examine the impact of seemingly irrelevant model details and discuss randomization strategies, both centralized and decentralized. Conclude with an analysis of rock-paper-scissors as an example of mixed-strategy equilibrium. Dive into topics such as voter preferences, policy implications of segregation, and the distinction between pure and mixed strategies in game theory.

Syllabus

- Chapter 1. Candidate - Voter Model.
- Chapter 2. Location and Segregation: Why Outcomes Are Not Necessarily Preferences.
- Chapter 3. Location and Segregation: Examples.
- Chapter 4. Location and Segregation: Policy Implications.
- Chapter 5. Location and Segregation: Central vs. Individual Randomization.
- Chapter 6. Pure vs. Mixed Strategies: Rock, Paper, Scissors.

Taught by

YaleCourses

Reviews

Start your review of Nash Equilibrium - Location, Segregation and Randomization in Game Theory

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.