Session 15 - Backward induction: chess, strategies, and credible threats
Document Actions
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.
ECON 159: Game Theory
| Lecture 15 - Backward induction: chess, strategies, and credible threats |
Overview:
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.
Reading assignment:
Strategies and Games: Theory And Practice. (Dutta): Chapters 11-12
Strategy: An Introduction to Game Theory. (Watson): Chapter 21
Class lecture:
 |
 |
|
Resources:
Document Actions
|
Yale University 2011. Some rights reserved. Unless otherwise indicated in the applicable Credits section of certain lecture pages, all content on this web site is licensed under a Creative Commons License. Please refer to the Credits section to determine whether third-party restrictions on the use of content apply. |
