Explore the intricacies of deciding regular games in this 41-minute lecture by Bakh Khoussainov from UESTC, presented at the Simons Institute. Delve into the fascinating world of exponential time algorithms as they apply to game theory and equilibria in system design and analysis. Gain insights into the computational challenges and theoretical frameworks surrounding regular games, and discover how these concepts intersect with broader topics in computer science and mathematics.
Deciding Regular Games - A Playground for Exponential Time Algorithms
Overview
Syllabus
Deciding regular games: a playground for exponential time algorithms
Taught by
Simons Institute
Related Courses
-
Algorithms for Rank-1 Bimatrix Games
-
Games: From Logic and Automata to Algorithms
-
Theory of Computation, Fall 2020
-
Understanding and Extending the Quasipolynomial Time Algorithms for Parity Games
-
Localized Attractor Computations for Infinite-State Games
-
Computing a Fixed Point of Contraction Maps in Polynomial Queries
