Home Teaching Research CV Timetable
Previous Lecture: Link
Next Lecture: Link

# Lecture Slides


📗 Long Version:
Slides
📗 Short Version:
Slides

# List of Topics and Examples


📗 Socrative Game:

📗 Definitions and Theorems:

📗 Algorithms:

📗 Examples:
(1) Stackelberg Oligopoly
(2) Repeated Split Steal Games: Video
(3) Cartel through Repeated Cournot Duopoly

📗 Problems:
File: Questions ; Answers.

(1) Stackelberg Duopoly with Same MC
(2) Stackelberg Oligopoly
(3) Repeated Prisoners Dilemma
(4) Modified Repeated Prisoners Dilemma
(5) Repeated Study Dates: Video Explanation
(6) Repeated Bertrand Duopoly
(7) Group Work
(8) Modified Group Work: Video Explanation
Workbook (recommended): 28.1, 28.2, 28.3, 28.4, 28.5, 28.6, 28.7, 28.11
Workbook (doable): 28.8, 28.9, 28.10

# Related Questions


(38) How to find NE of Stackelberg with Cournot outcome? A: See video: Link.
(37) How do I know if a punishment strategy is credible or not? A: If the punishment strategy profile forms a NE, then it is credible and the equilibrium for the whole game is SPE; otherwise, it is not credible and the equilibrium is a NE but not SPE.
(34) How to find minimax payoff and punishment strategy? A: See in videos: discrete Repeated Split Steal Game; semi-continuous Repeated Study Dates; fully continuous Modified Group Work.

# ChatBox



Previous Lecture: Link
Next Lecture: Link





Last Updated: July 14, 2024 at 8:40 PM