Game Theory (ECON 159) In the first half of the lecture, we consider the chain-s...
Game Theory (ECON 159) We develop a simple model of bargaining, starting from an...
Game Theory (ECON 159) In the first half of the lecture, we consider the chain-s...
Game Theory (ECON 159) We first discuss Zermelo's theorem: that games like tic-t...
Game Theory (ECON 159) We first apply our big idea--backward induction--to analy...
YaleCourses |
(0) (0 Votes)
|
Views: (1065) Date: (19-03-10) Time: (01:07:07) |
Description: 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. Complete course materials are available at the Open Yale Courses website: open.yale.edu This course was recorded in Fall 2007.