Deciding Regular Games - A Playground for Exponential Time Algorithms

Offered By: Simons Institute via YouTube

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

Automata Theory
Stanford University via edX Introduction to Computational Thinking and Data Science
Massachusetts Institute of Technology via edX 算法设计与分析 Design and Analysis of Algorithms
Peking University via Coursera How to Win Coding Competitions: Secrets of Champions
ITMO University via edX Introdução à Ciência da Computação com Python Parte 2
Universidade de São Paulo via Coursera