
In this lecture we make a brief introduction to game theory.
In this lecture we make a brief introduction to strategic games.
In this lecture we introduce the Matching Pennies game.
In this lecture we introduce the Reachability game.
In this lecture we introduce some essential notation in strategic games and see the concept of best response.
In this lecture we introduce the concept of pure Nash equilibrium.
In this lecture we study several examples of Nash equilibria in strategic games.
In this lecture, we study dominated actions in game theory.
In this lecture, we study symmetric games in game theory.
In this lecture, we introduce extensive games and perfect information in game theory.
In this lecture, we introduce graphs and trees, which are essential for representing extensive-form games.
In this lecture, we introduce the definitions of extensive form with perfect information and extensive games with perfect information, laying the foundation for analyzing sequential decision-making in game theory.
In this lecture, we study backward induction.
In this lecture, we study strategies in perfect-information games.
In this lecture, we explore the connection between backward induction and Nash equilibrium in extensive-form games with perfect information.
In this lecture, we discuss a class of finite two-player extensive games with perfect information.
In this lecture, we explore two-player extensive games with perfect information that allow for the possibility of a draw. We examine how the introduction of draws affects strategy, outcomes, and solution concepts in finite games.
In this lecture, we solve problem 1 from the section of solved problems on extensive games with perfect information.
In this lecture, we solve problem 2 from the section of solved problems on extensive games with perfect information.
In this lecture, we solve problem 3 from the section of solved problems on extensive games with perfect information.
In this lecture, we solve problem 4 from the section of solved problems on extensive games with perfect information.
In this lecture, we introduce the notion of imperfect information in extensive-form games
In this lecture, we study perfect recall.
In this lecture, we define what a strategy means in the context of general extensive-form games, extending the notion beyond perfect-information settings.
In this lecture, we examine a concrete example of how to represent an extensive-form game with imperfect information in strategic form.
In this lecture, we study subgames.
In this lecture, we study subgame-perfect equilibrium.
In this lecture, we study the subgame-perfect equilibrium algorithm.
In this lecture, we study games with chance moves.
In this lecture, we solve problem 1 from the section of solved problems on extensive games with imperfect information.
In this lecture, we solve problem 2 from the section of solved problems on extensive games with imperfect information.
In this lecture, we solve problem 3 from the section of solved problems on extensive games with imperfect information.
In this lecture, we solve problem 4 from the section of solved problems on extensive games with imperfect information.
In this lecture, we make a brief introduction to expected utility theory.
In this lecture, we study some important basic concepts of expected utility theory.
In this lecture, we study important theorems and definitions in expected utility theory.
In this lecture, we study the axioms that define expected utility and rational decision-making under uncertainty.
In this lecture, we study the Allais Paradox.
In this lecture, we study the Ellsberg Paradox.
In this lecture, we solve problem 1 from the section of solved problems on expected utility theory.
In this lecture, we solve problem 2 from the section of solved problems on expected utility theory.
In this lecture, we solve problem 3 from the section of solved problems on expected utility theory.
In this lecture, we solve problem 4 from the section of solved problems on expected utility theory.
In this lecture, we solve problem 5 from the section of solved problems on expected utility theory.
In this lecture, we solve problem 6 from the section of solved problems on expected utility theory.
In this lecture, we solve problem 7 from the section of solved problems on expected utility theory.
In this lecture, we solve problem 8 from the section of solved problems on expected utility theory.
In this lecture, we make a brief introduction to strategic-form games with cardinal payoffs.
In this lecture, we make an introduction to mixed strategies in strategic-form games with cardinal payoffs.
In this lecture, we study a theorem related to Nash equilibrium in mixed strategies.
In this lecture, we study how to compute the mixed-strategy Nash equilibria.
In this lecture we study strict dominance and rationalizability in strategic-form games with cardinal payoffs.
In this lecture, we solve problem 1 from the section of solved problems on strategic-form games.
In this lecture, we solve problem 2 from the section of solved problems on strategic-form games.
In this lecture, we solve problem 3 from the section of solved problems on strategic-form games.
You’ve just stumbled upon the most complete, in-depth Game Theory course online.
Whether you want to:
- build the skills you need to get your first role involving strategic analysis or modeling
- move to a more senior position in economics, data science, or computer science
- become a computer scientist mastering in computation
- or just learn Game Theory to better understand competition, cooperation, and strategic thinking.
This complete Game Theory Masterclass is the course you need to do all of this, and more.
This course is designed to give you the Game Theory skills you need to become confident in strategic analysis and decision-making. By the end of the course, you will understand Game Theory deeply and be able to apply it to real-world scenarios, making you more productive as a computer scientist, economist, or data analyst.
What makes this course a bestseller?
Like you, thousands of others were frustrated and fed up with fragmented YouTube tutorials or incomplete and outdated courses that assume you already know a bunch of advanced concepts, as well as dense, textbook-style explanations that can put even the most dedicated learner to sleep.
Like you, they were tired of low-quality lessons, poorly explained ideas, and confusing content presented in the wrong order. That’s why so many find success in this complete Game Theory course. It’s designed for clarity and smooth progression through the material.
This course assumes no prior background and takes you from the absolute basics to key strategic concepts. You will learn the core principles of Game Theory and how to apply them to real-world scenarios in economics, computing, and beyond. It's a one-stop shop to master Game Theory. And if you want to go beyond the core content, you can do so at any time.
Here’s just some of what you’ll learn
(It’s okay if you don’t understand all this yet. You will in the course)
Understanding Strategic Interaction: Grasp the core principles of game theory, including rational decision-making, utility, equilibrium concepts, and types of games.
Exploring Game Types: Learn the differences between cooperative and non-cooperative games, simultaneous and sequential games, and how to model them effectively.
Nash Equilibrium and Best Responses: Understand how players choose optimal strategies and how equilibrium is reached in both pure and mixed strategies.
Extensive-Form Games and Backward Induction: Analyze games represented as trees and master the backward induction algorithm to find subgame perfect equilibria.
Games with Incomplete Information: Study one-sided and multi-sided incomplete information and learn to model uncertainty with the type-space approach.
Beliefs, Knowledge, and Rationality: Explore how players form beliefs, update them with Bayes’ rule, and how common knowledge shapes strategic behavior.
Applications in Economics, AI, and Beyond: Discover how game theory is applied in real-world scenarios, from auctions and bargaining to machine learning and algorithmic design.
What if I have questions?
As if this course wasn’t complete enough, I offer full support, answering any questions you have 7 days a week.
This means you’ll never find yourself stuck on one lesson for days on end. With my hand-holding guidance, you’ll progress smoothly through this course without any major roadblocks.
There’s no risk either!
This course comes with a full 30-day money-back guarantee. Meaning if you are not completely satisfied with the course or your progress, simply let me know and I’ll refund you 100%, every last penny no questions asked.
You either end up with solid Game Theory skills, ready to analyze strategic situations and apply powerful concepts across economics, AI, and decision-making, or you try the course and get all your money back if it is not for you.
You literally can’t lose.
Ready to get started, developer?
Enroll now using the “Add to Cart” button on the right, and begin your journey into the fascinating world of strategic thinking and decision-making with Game Theory. Or, take this course for a free spin using the preview feature, so you know you’re 100% certain this course is for you.
See you on the inside (hurry, Game Theory is waiting!)