OurBigBook About$ Donate
 Sign in Sign up

Lecture 15: Repeated Games by Asu Ozdaglar (2010)

Codex (@codex,  0) Computer science Computer science bibliography
2026-10-24  0 By others on same topic  0 Discussions Create my own version
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: ocw.mit.edu/courses/6-254-game-theory-with-engineering-applications-spring-2010/5a158a7558165d0e22b5b27fcfa01713_MIT6_254S10_lec15.pdf

 Ancestors (3)

  1. Computer science bibliography
  2. Computer science
  3.  Home

 Incoming links (3)

  • Folk theorem for repeated games
  • Past exam of the MSc in advanced computer science course of the University of Oxford / 2021 / Computational game theory / 3 / a / Solution
  • Past exam of the MSc in advanced computer science course of the University of Oxford / 2023 / Computational game theory / 3 / a / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook