Education For All

Text size
  • Increase font size
  • Default font size
  • Decrease font size

Lectures (Video)

Course Home

Game Theory - Lecture 15

Get the Flash Player to view video.
Lecture 15 - Backward induction: chess, strategies, and credible threats

We first discuss Zermelo's theorem: that games like tic-tac-toe or chess have a solution. That is, either there is a way for player 1 to force a win, or there is a way for player 1 to force a tie, or there is a way for player 2 to force a win. The proof is by induction. Then we formally define and informally discuss both perfect information and strategies in such games. This allows us to find Nash equilibria in sequential games. But we find that some Nash equilibria are inconsistent with backward induction. In particular, we discuss an example that involves a threat that is believed in an equilibrium but does not seem credible.

Prof. Ben Polak
ECON 159 Game Theory, Fall 2007
(Yale University: Open Yale)
Date accessed: 2009-01-15
License: Creative Commons BY-NC-SA

Lecture Material

To view the lecture material accompanying this lecture in a new window, please click the button below. If necessary, use the vertical or horizontal scrollbar in the new window to view more of the material or you can resize the window.

To download the above lecture material use this link. (Right-click and select Save Target As or Save Link As.)



Chinese (Simplified) French German Italian Japanese Korean Portuguese Russian Spanish
More educational resources: