YoVDO

Deciding Regular Games - A Playground for Exponential Time Algorithms

Offered By: Simons Institute via YouTube

Tags

Game Theory Courses Automata Theory Courses Finite State Machine Courses Computational Complexity Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
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.

Syllabus

Deciding regular games: a playground for exponential time algorithms


Taught by

Simons Institute

Related Courses

Game Theory
Stanford University via Coursera Model Thinking
University of Michigan via Coursera Online Games: Literature, New Media, and Narrative
Vanderbilt University via Coursera Games without Chance: Combinatorial Game Theory
Georgia Institute of Technology via Coursera Competitive Strategy
Ludwig-Maximilians-Universität München via Coursera