Deciding Regular Games - A Playground for Exponential Time Algorithms

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