Game Theory
Offered By: Stanford University via Coursera
Course Description
Overview
Popularized by movies such as "A Beautiful Mind," game theory is the mathematical modeling of strategic interaction among rational (and irrational) agents. Beyond what we call `games' in common language, such as chess, poker, soccer, etc., it includes the modeling of conflict among nations, political campaigns, competition among firms, and trading behavior in markets such as the NYSE. How could you begin to model keyword auctions, and peer to peer file-sharing networks, without accounting for the incentives of the people using them? The course will provide the basics: representing games and strategies, the extensive form (which computer scientists call game trees), Bayesian games (modeling things like auctions), repeated and stochastic games, and more. We'll include a variety of examples including classic games and a few applications.
You can find a full syllabus and description of the course here: http://web.stanford.edu/~jacksonm/GTOC-Syllabus.html
There is also an advanced follow-up course to this one, for people already familiar with game theory: https://www.coursera.org/learn/gametheory2/
You can find an introductory video here: http://web.stanford.edu/~jacksonm/Intro_Networks.mp4
Syllabus
- Week 1: Introduction and Overview
- Introduction, overview, uses of game theory, some applications and examples, and formal definitions of: the normal form, payoffs, strategies, pure strategy Nash equilibrium, dominant strategies
- Week 2: Mixed-Strategy Nash Equilibrium
- pure and mixed strategy Nash equilibria
- Week 3: Alternate Solution Concepts
- Iterative removal of strictly dominated strategies, minimax strategies and the minimax theorem for zero-sum game, correlated equilibria
- Week 4: Extensive-Form Games
- Perfect information games: trees, players assigned to nodes, payoffs, backward Induction, subgame perfect equilibrium, introduction to imperfect-information games, mixed versus behavioral strategies.
- Week 5: Repeated Games
- Repeated prisoners dilemma, finite and infinite repeated games, limited-average versus future-discounted reward, folk theorems, stochastic games and learning.
- Week 6: Bayesian Games
- General definitions, ex ante/interim Bayesian Nash equilibrium.
- Week 7: Coalitional Games
- Transferable utility cooperative games, Shapley value, Core, applications.
- Week 8: Final Exam
- The description goes here
Taught by
Matthew O. Jackson and Yoav Shoham
Tags
Related Courses
Advanced Capstone Spacecraft Dynamics and Control ProjectUniversity of Colorado Boulder via Coursera 算法设计与分析 Design and Analysis of Algorithms
Peking University via Coursera Fundamentos del análisis de datos para la toma de decisiones
Tecnológico de Monterrey via Coursera On Ramp to AP* Biology
Weston High School via edX Applied Calculus with Python
Johns Hopkins University via Coursera