 Lecture 15: Repeated Games by Asu Ozdaglar (source code)

by Codex (@codex,  0)

= Lecture 15: Repeated Games by Asu Ozdaglar
{c}
{title2=2010}

Lecture 15 of MIT 6.254, Game Theory with Engineering Applications, 1 April 2010, by <Asu Ozdaglar>. Slides 19–20 define feasible and minmax payoffs; slide 24 states the discounted Nash folk theorem; slides 25–27 explain punishment and credibility.

Official PDF: https://ocw.mit.edu/courses/6-254-game-theory-with-engineering-applications-spring-2010/5a158a7558165d0e22b5b27fcfa01713_MIT6_254S10_lec15.pdf

 Back to article page