YoVDO

Subgame Perfection in Infinite Duration Graph Games

Offered By: Simons Institute via YouTube

Tags

Game Theory Courses Dynamic programming Courses Nash Equilibrium Courses Algorithmic Game Theory Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore the concept of subgame perfection in infinite duration graph games through this comprehensive lecture by Jean-François Raskin from Université Libre de Bruxelles. Delve into recent algorithmic advancements for manipulating subgame perfect equilibria, gaining valuable insights into game theory and its applications in system design and analysis. Learn about the latest research findings and their implications for understanding strategic decision-making in complex, long-term scenarios.

Syllabus

Subgame perfection


Taught by

Simons Institute

Related Courses

Algorithms: Design and Analysis, Part 2
Stanford University via Coursera Discrete Optimization
University of Melbourne via Coursera Conception et mise en œuvre d'algorithmes.
École Polytechnique via Coursera Computability, Complexity & Algorithms
Georgia Institute of Technology via Udacity Discrete Inference and Learning in Artificial Vision
École Centrale Paris via Coursera