Skip to main content
Graph
Search
fr
|
en
Login
Search
All
Categories
Concepts
Courses
Lectures
MOOCs
People
Practice
Publications
Startups
Units
Show all results for
Home
Lecture
Connect Four: α-β Pruning vs Monte-Carlo Tree Search
Graph Chatbot
Related lectures (28)
Previous
Page 3 of 3
Next
Safe Learning for Autonomous Systems
Explores challenges in control, safety, and coordination for autonomous systems like autonomous cars, focusing on safe learning and Nash equilibria.
Dynamic Games: Theory and Applications
Covers dynamic games, focusing on their structure, applications, and the transition from tree to loop models.
Game Theory: Minimax Theorem
Explores zero-sum games and the minimax theorem in Game Theory, emphasizing optimal strategies.
Convex Games: Applications and Equilibria
Covers convex games, their equilibria, and applications in various fields such as traffic and electricity markets.
Multi-Agent Systems: Traffic Management and Pricing Strategies
Covers multi-agent systems in traffic management and dynamic pricing strategies using game theory.
Game Theory: Learning in Finite Action Games
Covers learning dynamics in finite action games and explores various types of equilibria, including correlated and coarse correlated equilibria.
Farkas' Lemma: Applications in Game Theory
Explores Farkas' Lemma, hyperplane separation, combinatorics, and its application in game theory, focusing on penalty kick strategies.
Bidding Strategies: Game Theory & Market Power
Covers bidding strategies, Game Theory, Nash equilibrium, system security, ancillary services, and market power in power systems.