Finding the Optimal Strategy in a Three-Player Integer Game - Game Theory Analysis
Wrath of Math via YouTube
The Most Addictive Python and SQL Courses
Learn AI, Data Science & Business — Earn Certificates That Get You Hired
Overview
Google, IBM & Meta Certificates – 40% Off
One plan covers every Professional Certificate on Coursera.
Unlock All Certificates
Explore game theory concepts through a 30-minute mathematical analysis of a three-player game where players simultaneously choose positive integers, with the smallest unique number winning. Learn about Nash equilibrium, mixed strategies, and symmetric equilibrium solutions while working through the mathematical puzzle step by step. Delve into the strategic complexity of finding optimal solutions where no player would benefit from changing their strategy, even when all players are aware of each other's approaches. Follow along with detailed algebraic explanations and discover multiple equilibrium states that emerge from this seemingly simple yet mathematically rich game scenario.
Syllabus
Intro
Nash Equilibrium
Mixed Strategies
Finding a Trivial Equilibrium
Symmetric Nash Equilibrium
The Solution Part 1
The Solution Part 2
Algebra
Final Details
Conclusion
Taught by
Wrath of Math