Lectures related to Combinatorial game theory

Covers game theory fundamentals, Nash equilibrium, and strategic interactions in multi-agent systems.

Covers potential games, best response dynamics, and the convergence to Nash equilibria.

Explores applying game theory to optimize strategies in Connect Four using advanced algorithms.

Explores strategies to solve Connect Four using α-β pruning and Monte-Carlo tree search.

Explores game theory strategies to solve Connect Four efficiently using minimax, alpha-beta pruning, and Monte Carlo methods.

Explores solving Connect Four using game theory algorithms to find optimal strategies efficiently.

Covers intelligent agents, decision-making, planning, machine learning, and game theory.

Discusses Stackelberg games and backward induction, illustrating game theory concepts through examples and applications in real-world scenarios.

Covers zero-sum games, focusing on Nash equilibria, security strategies, and their applications in various scenarios.

Explores solving Connect Four using game theory algorithms and compares their efficiency.

Explores solving Connect Four using game theory and algorithms optimization, comparing minimax, alpha-beta pruning, and Monte-Carlo tree search.

Explores Monte Carlo Tree Search and Alpha Zero in deep reinforcement learning.

Explores solving Connect Four using game theory algorithms and compares Alpha-Beta pruning with Monte-Carlo tree search.

Provides guidance on project proposals in game theory, showcasing past examples and emphasizing problem formulation and mathematical modeling.

Explores solving Connect Four using game theory algorithms and compares their performance.

Explores challenges in control, safety, and coordination for autonomous systems like autonomous cars, focusing on safe learning and Nash equilibria.

Explores multistage games, focusing on extensive form and feedback strategies, including Nash equilibria and backward induction methods.

Covers the basics of static games and introduces key game theory concepts, including the Prisoner's Dilemma and Nash Equilibrium.

Explores solving Connect Four using game theory and algorithms for optimal strategy in minimum time.

Explores separating hyperplanes for two sets X and Y, discussing conditions for separation and implications of convexity.