3-2 Strictly Dominated Strategies & Iterative Removal

Loading...
Stanford University
4.6 (2,561 ratings) | 220K Students Enrolled
View Syllabus

Skills You'll Learn

Game Theory, Backward Induction, Bayesian Game, Problem Solving

Reviews

4.6 (2,561 ratings)
  • 5 stars
    1,855 ratings
  • 4 stars
    566 ratings
  • 3 stars
    98 ratings
  • 2 stars
    26 ratings
  • 1 star
    16 ratings
DA

Apr 14, 2019

It was such a helpful course that gave me the opportunity to learn few basic methods and terms about game theory through lots of interesting and to the point examples by three unique professors

LY

Dec 30, 2017

Easily the most challenging introductory course I've taken, but definitely worth it. I must say though that I learnt more from failing the quizzes than the lectures or practice questions.

From the lesson
Week 3: Alternate Solution Concepts
Iterative removal of strictly dominated strategies, minimax strategies and the minimax theorem for zero-sum game, correlated equilibria

Taught By

  • Matthew O. Jackson

    Matthew O. Jackson

    Professor
  • Kevin Leyton-Brown

    Kevin Leyton-Brown

    Professor
  • Yoav Shoham

    Yoav Shoham

    Professor

Explore our Catalog

Join for free and get personalized recommendations, updates and offers.