Lectures (Video)
- 1. Introduction
- 2. Putting yourselves into other people's shoes
- 3. Iterative deletion and the median-voter theorem
- 4. Best responses in soccer and business partnerships
- 5. Nash equilibrium: bad fashion and bank runs
- 6. Nash equilibrium: dating and Cournot
- 7. Nash equilibrium: shopping, standing and voting on a line
- 8. Nash equilibrium: location, segregation and randomization
- 9. Mixed strategies in theory and tennis
- 10. Mixed strategies in baseball, dating and paying your taxes
- 11. Evolutionary stability: cooperation, mutation, and equilibrium
- 12. Evolutionary stability: social convention, aggression, and cycles
- 13. Sequential games: moral hazard, incentives, and hungry lions
- 14. Backward induction: commitment, spies, and first-mover
- 15. Backward induction: chess, strategies, and credible threats
- 16. Backward induction: reputation and duels
- 17. Backward induction: ultimatums and bargaining
- 18. Imperfect information: information sets and sub-game
- 19. Subgame perfect equilibrium: matchmaking and strategic investments
- 20. Subgame perfect equilibrium: wars of attrition
- 21. Repeated games: cooperation vs. the end game
- 22. Repeated games: cheating, punishment, and outsourcing
- 23. Asymmetric information: silence, signaling and suffering education
- 24. Asymmetric information: auctions and the winner's curse
Game Theory - Lecture 2
|
Get the Flash Player to view video.
Lecture 2 - Putting yourselves into other people's shoes
At the start of the lecture, we introduce the "formal ingredients" of a game: the players, their strategies and their payoffs. Then we return to the main lessons from last time: not playing a dominated strategy; and putting ourselves into others' shoes. We apply these first to defending the Roman Empire against Hannibal; and then to picking a number in the game from last time. We learn that, when you put yourself in someone else's shoes, you should consider not only their goals, but also how sophisticated are they (are they rational?), and how much do they know about you (do they know that you are rational?). We introduce a new idea: the iterative deletion of dominated strategies. Finally, we discuss the difference between something being known and it being commonly known.
Prof. Ben Polak
ECON 159 Game Theory, Fall 2007 (Yale University: Open Yale) http://oyc.yale.edu 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.)
