Course Hive
Search

Welcome

Sign in or create your account

Continue with Google
or
14. Backward induction: commitment, spies, and first-mover advantages
Play lesson

Game Theory with Ben Polak - 14. Backward induction: commitment, spies, and first-mover advantages

4.0 (3)
25 learners

What you'll learn

This course includes

  • 28.5 hours of video
  • Certificate of completion
  • Access on mobile and TV

Summary

Keywords

Full Transcript

Game Theory (ECON 159) We first apply our big idea--backward induction--to analyze quantity competition between firms when play is sequential, the Stackelberg model. We do this twice: first using intuition and then using calculus. We learn that this game has a first-mover advantage, and that it comes commitment and from information in the game rather than the timing per se. We notice that in some games having more information can hurt you if other players know you will have that information and hence alter their behavior. Finally, we show that, contrary to myth, many games do not have first-mover advantages. 00:00 - Chapter 1. Sequential Games: First Mover Advantage in the Stackelberg Model 38:13 - Chapter 2. First Mover Advantage: Commitment Strategy 49:25 - Chapter 3. First Mover Advantage: Why It Is Not Always an Advantage 55:53 - Chapter 4. First and Second Mover Advantage: NIM Complete course materials are available at the Yale Online website: online.yale.edu This course was recorded in Fall 2007.

Course Hive

Continue this lesson in the app

Install CourseHive on Android or iOS to keep learning while you move.

FAQs

Course Hive
Download CourseHive
Keep learning anywhere