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

Algorithmic Game Theory
Indian Institute of Technology, Kharagpur via Swayam Theory Seminar - Submodular Maximization
Paul G. Allen School via YouTube Mechanisms for a No-Regret Agent - Beyond the Common Prior
IEEE via YouTube Resolving the Optimal Metric Distortion Conjecture
IEEE via YouTube Algorithmic Game Theory - Session 8C
IEEE via YouTube