Game Theory

Yale,, Fall 2007 , Prof. Ben Polak

Updated On 02 Feb, 19

Overview

Introduction - Putting yourselves into other peoples shoes - Iterative deletion and the median-voter theorem - Best responses in soccer and business partnerships - Nash equilibrium: bad fashion and bank runs - Nash equilibrium: dating and Cournot - Nash equilibrium: shopping, standing and voting on a line - Nash equilibrium: location, segregation and randomization - Mixed strategies in theory and tennis - Mixed strategies in baseball, dating and paying your taxes - Evolutionary stability: cooperation, mutation, and equilibrium - Evolutionary stability: social convention, aggression, and cycles - Sequential games: moral hazard, incentives, and hungry lions - Backward induction: commitment, spies, and first-mover advantages - Backward induction: chess, strategies, and credible threats - Backward induction: reputation and duels - Backward induction: ultimatums and bargaining - Imperfect information: information sets and sub-game perfection -Subgame perfect equilibrium: matchmaking and strategic investments - Subgame perfect equilibrium: wars of attrition - Repeated games: cooperation vs. the end game - Repeated games: cheating, punishment, and outsourcing - Asymmetric information: silence, signaling and suffering education - Asymmetric information: auctions and the winner

Includes

On-demand Videos
Login & Track your progress
Full Lifetime acesses

Lecture 11: Evolutionary stability cooperation, mutation, and equilibrium

4.1 ( 11 )

Lecture Details

We discuss evolution and game theory, and introduce the concept of evolutionary stability. We ask what kinds of strategies are evolutionarily stable, and how this idea from biology relates to concepts from economics like domination and Nash equilibrium. The informal argument relating these ideas toward at the end of his lecture contains a notation error [U(_, S) should be U(S, _)]. A more formal argument is provided in the supplemental notes.